Related papers: Strong Log-Concavity Does Not Imply Log-Submodular…

By using the Rodriguez-Villegas-Mortenson supercongruences, we prove four supercongruences on sums involving binomial coefficients, which were originally conjectured by Sun. We also confirm a related conjecture of Guo on integer-valued…

Submodularity is a discrete domain functional property that can be interpreted as mimicking the role of the well-known convexity/concavity properties in the continuous domain. Submodular functions exhibit strong structure that lead to…

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

We study the log-concave measures, their characterization via the Pr\'ekopa-Leindler property and also define a subset of it whose elements are called super log-concave measures which have the property of satisfying a logarithmic Sobolev…

We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds, but a strong form of this theorem does not hold. Translating these…

Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…

We prove that the non-vanishing conjecture and the log minimal model conjecture for projective log canonical pairs can be reduced to the non-vanishing conjecture for smooth projective varieties such that the boundary divisor is zero.

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic subset K of Rn. Namely, they belong to a specific subset of the quadratic module generated by the…

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…

The goal of this paper is a classification theorem of the singularities according to a new invariant, Mather discrepancy. On the other hand, we show some evidences convincing us that Mather discrepancy is a considerable invariant: By…

In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We…

We show that, under certain assumptions, strongly finitary enriched monads are given by discrete enriched Lawvere theories. On the other hand, monads given by discrete enriched Lawvere theories preserve surjections.

One question that we investigate in this paper is, how can we build log-concave polynomials using sparse polynomials as building blocks? More precisely, let $f = \sum\_{i = 0}^d a\_i X^i \in \mathbb{R}^+[X]$ be a polynomial satisfying the…

In recent years, log-concave density estimation via maximum likelihood estimation has emerged as a fascinating alternative to traditional nonparametric smoothing techniques, such as kernel density estimation, which require the choice of one…

Let $P_{n,k}$ be the number of permutations $\pi$ on [n]={1, 2,..., n} such that the length of the longest increasing subsequences of $\pi$ equals k, and let $M_{2n, k}$ be the number of matchings on [2n] with crossing number k. Define…

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…

Recently, Z.-W. Sun introduced two kinds of polynomials related to the Delannoy numbers, and proved some supercongruences on sums involving those polynomials. We deduce new summation formulas for squares of those polynomials and use them to…

A logconcave likelihood is as important to proper statistical inference as a convex cost function is important to variational optimization. Quantization is often disregarded when writing likelihood models, ignoring the limitations of the…