Related papers: Calculus proofs of some combinatorial inequalities
We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.
The log-rank conjecture is one of the fundamental open problems in communication complexity. It speculates that the deterministic communication complexity of any two-party function is equal to the log of the rank of its associated matrix,…
We introduce the notion of interlacing log-concavity of a polynomial sequence $\{P_m(x)\}_{m\geq 0}$, where $P_m(x)$ is a polynomial of degree m with positive coefficients $a_{i}(m)$. This sequence of polynomials is said to be interlacing…
This paper extends the dual calculus with inductive types and coinductive types. The paper first introduces a non-deterministic dual calculus with inductive and coinductive types. Besides the same duality of the original dual calculus, it…
We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
This paper explores some connections between rank one convexity, multiplicative quasiconvexity and Schur convexity. Theorem 5.1 gives simple necessary and sufficient conditions for an isotropic objective function to be rank one convex on…
We review the notion of symplectic duality earlier introduced in the context of topological recursion. We show that the transformation of symplectic duality can be expressed as a composition of $x-y$ dualities in a broader context of log…
In this note we offer some log-concavity properties of certain functions related to Bessel functions of the first kind and modified Bessel functions of the first and second kind, by solving partially a recent conjecture on the…
The inverse problem of the calculus of variations consists in determining if the solutions of a given system of second order differential equations correspond with the solutions of the Euler-Lagrange equations for some regular Lagrangian.…
We present an elementary proof of a conjecture by I. Ra\c{s}a which is an inequality involving Bernstein basis polynomials and convex functions. It was affirmed in positive very recently by the use of stochastic convex orderings. Moreover,…
We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…
We prove in three ways the basic fact of analysis that complex derivatives are continuous. The first, classical, proof of Cauchy and Goursat uses integration. The second proof of Whyburn and Connell is topological and is based on the…
We prove that the (B) conjecture and the Gardner-Zvavitch conjecture are true for all log-concave measures that are rotationally invariant, extending previous results known for Gaussian measures. Actually, our result apply beyond the case…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
In this article, we prove that convex functions and log-convex functions obey certain general refinements that lead to several refinements and reverses of well known inequalities for matrices, including Young's inequality, Heinz inequality,…
We introduce poly-Cauchy permutations that are enumerated by the poly-Cauchy numbers. We provide combinatorial proofs for several identities involving poly-Cauchy numbers and some of their generalizations. The aim of this work is to…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…