Related papers: Gamma-positivity in combinatorics and geometry
The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…
We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…
We generalize our puzzle formula for ordinary Schubert calculus on Grassmannians, to a formula for the T-equivariant Schubert calculus. The structure constants to be calculated are polynomials in {y_{i+1} - y_i}; they were shown…
We compute the quadratic Euler characteristic of the symmetric powers of a smooth, projective curve over any field $k$ that is not of characteristic two, using the Motivic Gauss-Bonnet Theorem of Levine-Raksit. As an application, we show…
We prove the $\Gamma$-convergence of the renormalised fractional Gaussian $s$-perimeter to the Gaussian perimeter as $s\to 1^-$. Our definition of fractional perimeter comes from that of the fractional powers of Ornstein-Uhlenbeck operator…
Newton's identities provide a way to express elementary symmetric polynomials in terms of power polynomials over fields of characteristic zero. In this article, we study the failure of this relation in positive characteristic and what can…
The purpose of this paper is to generalize this relation of symmetry between the power sum polynomials and the generalized Euler polynomials to the relation between the power sum polynomials and the generalized higher-order Euler…
If a geometry $\Gamma$ is isomorphic to the residue of a point $A$ of a shadow geometry of a spherical building $\Delta$, a representation $\varepsilon_\Delta^A$ of $\Gamma$ can be given in the unipotent radical $U_{A^*}$ of the stabilizer…
In this paper, we establish more properties of generalized poly-Euler polynomials with three parameters and we investigate a kind of symmetrized generalization of poly- Euler polynomials. Moreover, we introduce a more general form of multi…
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…
Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…
In this note we present a method for obtaining a wide class of combinatorial identities. We give several examples, in particular, based on the Gamma and Beta functions. Some of them have already been considered by previously, and other are…
Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $\pi$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
This paper was motivated by a conjecture of Br\"{a}nd\'{e}n (European J. Combin. \textbf{29} (2008), no.~2, 514--531) about the divisibility of the coefficients in an expansion of generalized Eulerian polynomials, which implies the…
In this paper, we consider matrices whose entries are combinatorial sequences which can be expressed in terms of a convolution of elementary and complete homogeneous symmetric functions. We establish the total positivity of these matrices…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
It is a classical fundamental result that Schur-positive specializations of the ring of symmetric functions are characterized via totally positive functions whose parametrization describes the Edrei-Thoma theorem. In this paper we study…
We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…
We study a family of symmetric polynomials that we refer to as the Boolean product polynomials. The motivation for studying these polynomials stems from the computation of the characteristic polynomial of the real matroid spanned by the…