Pooneh Afsharijoo
In this paper, we prove a theorem which adds a new member to the famous Göellnitz-Gordon identities. We construct a "new system of recurrence formulas" in order to prove it.
Menampilkan 20 dari ~2082478 hasil · dari CrossRef, arXiv, DOAJ
Pooneh Afsharijoo
In this paper, we prove a theorem which adds a new member to the famous Göellnitz-Gordon identities. We construct a "new system of recurrence formulas" in order to prove it.
Ryotaro Nohagi
We determine the Sprague-Grundy value for the Common Divisor Nim$_m$ (CDN$_m$ for short) for $m \in \mathbb{Z}_{\ge 1}$, which is called COMMON DIVISOR game in [ANW, Chapter 2, Exercise 8 (p.55)].
Jidong Wang
This short article serves as the appendix for [Tran and Wang, 2022]. We prove that a complete intersection of $n$ generic polyhedral hypersurfaces in $\mathbb{R}^d$ is $(d-n-1)$-connected for $d\geq 2, d>n$.
Gary Detlefs, Wolfdieter Lang
The standard formula for the multi-section of the general linear three-term recurrence relation is simplified in terms of Chebyshev S-polynomials.
Raphael Steck
We show that we can assume graphs that do not have the edge-Erdős-Pósa property to be connected. Then we strengthen this result to $2$-connectivity under the additional assumptions of a minor-closed property and a generic counterexample.
David Ellis
In this very short note, we give a counterexample to a recent conjecture of Gilmer which would have implied the union-closed conjecture.
Leilei Zhang
In 1968, Ore determined the maximum size of $k$-connected graphs with given order and diameter. In this note, we give a new short proof.
Oliver Knill
We show that the curvature K_(G*H)(x,y) at a point (x,y) in the strong product G*H of two arbitrary finite simple graphs is equal to the product K_G(x) K_H(y) of the curvatures.
ROYA BAHRAMIAN, NEDA AHANJIDEH
For a character $\unicode[STIX]{x1D712}$ of a finite group $G$, the co-degree of $\unicode[STIX]{x1D712}$ is $\unicode[STIX]{x1D712}^{c}(1)=[G:\text{ker}\unicode[STIX]{x1D712}]/\unicode[STIX]{x1D712}(1)$. We study finite groups whose co-degrees of nonprincipal (complex) irreducible characters are divisible by a given prime $p$.
Austin Roberts
We consider families of quasisymmetric functions with the property that if a symmetric function f is a positive sum of functions in one of these families, then f is necessarily a positive sum of Schur functions. Furthermore, in each of the families studied, we give a combinatorial description of the Schur coefficients of f. We organize six such families into a poset, where functions in higher families in the poset are always positive integer sums of functions in each of the lower families.
Luigi Cantini, Jan De Gier, Michael Wheeler
We present a new, explicit sum formula for symmetric Macdonald polynomials Pλ and show that they can be written as a trace over a product of (infinite dimensional) matrices. These matrices satisfy the Zamolodchikov– Faddeev (ZF) algebra. We construct solutions of the ZF algebra from a rank-reduced version of the Yang–Baxter algebra. As a corollary, we find that the normalization of the stationary measure of the multi-species asymmetric exclusion process is a Macdonald polynomial with all variables set equal to one.
Robin Sulzgruber
We define two refinements of the skew length statistic on simultaneous core partitions. The first one relies on hook lengths and is used to prove a refined version of the theorem stating that the skew length is invariant under conjugation of the core. The second one is equivalent to a generalisation of Shi tableaux to the rational level of Catalan combinatorics. We prove that the rational Shi tableau is injective. Moreover we present a uniform definition of the rational Shi tableau for Weyl groups and conjecture injectivity in the general case.
Axel Bacher, Manuel Kauers, Rika Yatchak
We continue the investigations of lattice walks in the three-dimensional lattice restricted to the positive octant. We separate models which clearly have a D-finite generating function from models for which there is no reason to expect that their generating function is D-finite, and we isolate a small set of models whose nature remains unclear and requires further investigation. For these, we give some experimental results about their asymptotic behaviour, based on the inspection of a large number of initial terms. At least for some of them, the guessed asymptotic form seems to tip the balance towards non-D-finiteness.
Edoardo Ballico, Sukmoon Huh
Helmut Prodinger
The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.
Jerry S. Kelly
Determination of the range of a variety of social choice correspondences: Plurality voting, the Borda rule, the Pareto rule, the Copeland correspondence, approval voting, and the top cycle correspondence
De Ke Zhao
Zhendong Fu, Yanzhen Zheng, Yinguo Xiao et al.
Simone Costa
In this paper we provide a generalization of the MPS construction of blocking sets of $PG(r,q^n)$ using subspaces of dimension $s\leq n-2$. By this construction, we determine a new non-planar example in $PG(3,q^6)$.
Kathleen O'Hara, Dennis Stanton
Refinements of the classical Rogers-Ramanujan identities are given in which some parts are weighted. Combinatorial interpretations refining MacMahon's results are corollaries.
Halaman 20 dari 104124