Related papers: Calculus proofs of some combinatorial inequalities
Okounkov [Oko03] conjectured the log-concavity about the structure constants for many interesting basis from representation theory. For the cluster algebra, Gross, Hacking, Keel, Kontsevich [GHKK18] introduced the atomic theta basis. We…
This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generalizes inductive types equipped with higher-order primitive…
The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…
Some natural inequalities related to rearrangement in matrix products can also be regarded as extensions of classical inequalities for sequences or integrals. In particular, we show matrix versions of Chebyshev and Kantorovich type…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
Using techniques from the theories of convex polytopes, lattice paths, and indirect influences on directed manifolds, we construct continuous analogues for the binomial coefficients and the Catalan numbers. Our approach for constructing…
We establish discrete and continuous log-concavity results for a biparametric extension of the $q$-numbers and of the $q$-binomial coefficients. By using classical results for the Jacobi theta function we are able to lift some of our…
The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic. Formal proofs in the sequent calculus are finite trees obtained…
Boolean calculus has been studied extensively in the past in the context of switching circuits, error-correcting codes etc. This work generalizes several approaches to defining a differential calculus for Boolean functions. A unified theory…
In this paper, we consider the poly-cauchy polynomials and numbers of the second kind which were studied by Komatsu in [10]. We note that the poly-Cauchy polynomials of the second kind are the special generalized Bernoulli polynomials of…
We study the equivariant cohomology classes of torus-equivariant subvarieties of the space of matrices. For a large class of torus actions, we prove that the polynomials representing these classes (up to suitably changing signs) are…
In their study of a quartic integral, Boros and Moll discovered a special class of Jacobi polynomials, which we call the Boros-Moll polynomials. Kauers and Paule proved the conjecture of Moll that these polynomials are log-concave. In this…
Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…
Descent polynomials and peak polynomials, which enumerate permutations with given descent and peak sets respectively, have recently received considerable attention. We give several formulas for $q$-analogs of these polynomials which refine…
Horizontal and vertical generating functions and recursion relations have been investigated by Comtet for triangular double sequences. In this paper we investigate the horizontal and vertical log-concavity of triangular sequences assigned…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…
In this paper we prove some monotonicity, log--convexity and log--concavity properties for the Volterra and incomplete Volterra functions. Moreover, as consequences of these results, we present some functional inequalities (like Tur\'an…
We consider a nonlocal functional equation that is a generalization of the mathematical model used in behavioral sciences. The equation is built upon an operator that introduces a convex combination and a nonlinear mixing of the function…