English
Related papers

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

200 papers

In this note we prove positivity of Maclaurin coefficients of polynomials written in terms of rising factorials and arbitrary log-concave sequences. These polynomials arise naturally when studying log-concavity of rising factorial series.…

Classical Analysis and ODEs · Mathematics 2012-03-08 Dmitry Karp

We show that Thom polynomials of Lagrangian singularities have nonnegative coefficients in the basis consisting of Q-functions. The main tool in the proof is nonnegativity of cone classes for globally generated bundles.

Algebraic Geometry · Mathematics 2009-09-06 Malgorzata Mikosz , Piotr Pragacz , Andrzej Weber

It was conjectured that multiplicity of a singularity is bi-Lipschitz invariant. We disprove this conjecture, constructing examples of bi-Lipschitz equivalent complex algebraic singularities with different values of multiplicity.

Algebraic Geometry · Mathematics 2021-09-20 Lev Birbrair , Alexandre Fernandes , J. Edson Sampaio , Misha Verbitsky

Menon's proof of the preservation of log-concavity of sequences under convolution becomes simpler when adapted to 2-sided infinite sequences. Under assumption of log-concavity of two 2-sided infinite sequences, the existence of the…

Combinatorics · Mathematics 2019-03-07 Stephan Foldes , Laszlo Major

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…

Logic · Mathematics 2020-08-12 Robert Goldblatt , Ian Hodkinson

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

Logic · Mathematics 2023-12-01 Nick Bezhanishvili , Anna Dmitrieva , Jim de Groot , Tommaso Moraschini

Seminal work by Edmonds and Lovasz shows the strong connection between submodularity and convexity. Submodular functions have tight modular lower bounds, and subdifferentials in a manner akin to convex functions. They also admit poly-time…

Discrete Mathematics · Computer Science 2015-09-09 Rishabh Iyer , Jeff Bilmes

A fundamental theorem in discrete convex analysis states that a set function is M$^\natural$-concave if and only if its conjugate function is submodular. This paper gives a new proof to this fact.

Combinatorics · Mathematics 2022-12-14 Kazuo Murota , Akiyoshi Shioura

Log-concave distributions are an attractive choice for modeling and inference, for several reasons: The class of log-concave distributions contains most of the commonly used parametric distributions and thus is a rich and flexible…

Methodology · Statistics 2010-10-05 Guenther Walther

We extend the exponential formula by Bender and Canfield (1996), which relates log-concavity and the cycle index polynomials. The extension clarifies the log-convexity relation. The proof is by noticing the property of a compound Poisson…

Combinatorics · Mathematics 2017-07-31 Muneya Matsui

We consider polynomials expressing the cohomology classes of subvarieties of products of projective spaces, and limits of positive real multiples of such polynomials. We study the relation between these covolume polynomials and Lorentzian…

Algebraic Geometry · Mathematics 2025-04-02 Paolo Aluffi

We consider the class of all homogeneous, possibly non-reduced, polynomials $f$ whose associated reduced projective divisor $D_{\text{red}} \subset \mathbb{P}^{n-1}$ has (at worst) quasi-homogeneous isolated singularities. In an arbitrary…

Algebraic Geometry · Mathematics 2026-02-25 Daniel Bath , Willem Veys

We prove sharp anti-concentration results for log-concave random variables on the real line in both the discrete and continuous setting. Our approach is elementary and uses majorization techniques to recover and extend some recent and not…

Probability · Mathematics 2025-05-12 Tulio Gaxiola , James Melbourne , Vincent Pigno , Emma Pollard

In this note we sketch a proof of a fundamental conjecture, the codimension-three conjecture, for microdifferential holonomic systems with regular singularities. It states that any regular holonomic E-module extends beyond a…

Algebraic Geometry · Mathematics 2015-12-22 Masaki Kashiwara , Kari Vilonen

Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…

Machine Learning · Computer Science 2016-02-24 Francis Bach

We develop a new technique for proving distribution testing lower bounds for properties defined by inequalities involving the bin probabilities of the distribution in question. Using this technique we obtain new lower bounds for…

Machine Learning · Computer Science 2023-08-02 Yuqian Cheng , Daniel M. Kane , Zhicheng Zheng

We prove congruence relations modulo cyclotomic polynomials for multisums of $q$-factorial ratios, therefore generalizing many well-known $p$-Lucas congruences. Such congruences connect various classical generating series to their…

Combinatorics · Mathematics 2017-01-24 Boris Adamczewski , Jason P. Bell , Éric Delaygue , Frédéric Jouhet

For a graph $G$, and a nonnegative integer $g$, let $a_g(G)$ be the number of $2$-cell embeddings of $G$ in an orientable surface of genus $g$ (counted up to the combinatorial homeomorphism equivalence). In 1989, Gross, Robbins, and Tucker…

Combinatorics · Mathematics 2025-12-30 Bojan Mohar

In this work, we develop a new theory of multivariate V-filtration on D-modules along a simple normal crossing divisor and relate it with Sabbah's multi-filtration. We establish several new structural results and relate them with the Hodge…

Algebraic Geometry · Mathematics 2026-05-28 Dougal Davis , Ruijie Yang

Submodularity is an important concept in combinatorial optimization, and it is often regarded as a discrete analog of convexity. It is a fundamental fact that the set of minimizers of any submodular function forms a distributive lattice.…

Discrete Mathematics · Computer Science 2019-10-14 Tomohito Fujii , Shuji Kijima