English
Related papers

Related papers: A note on the log-concavity of parking functions

200 papers

A pair $(G,K)$ of a group and its subgroup is called a Gelfand pair if the induced trivial representation of $K$ on $G$ is multiplicity free. Let $(a_j)$ be a sequence of positive integers of length $n$, and let $(b_i)$ be its…

Combinatorics · Mathematics 2010-09-28 Kürşat Aker , Mahir Bilen Can

Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connected graphs in 1977, and Kreweras related the inversions of…

Data Structures and Algorithms · Computer Science 2007-05-23 Donald E. Knuth

We show that a set function $\nu$ satisfies the gross substitutes property if and only if its homogeneous generating polynomial $Z_{q,\nu}$ is a Lorentzian polynomial for all positive $q \le 1$, answering a question of Eur-Huh. We achieve…

A matching $M$ in a multigraph $G=(V,E)$ is said to be uniquely restricted if $M$ is the only perfect matching in the subgraph of $G$ induced by $V(M)$ (i.e., the set of vertices saturated by $M$). For any fixed vertex $x_0$ in $G$, there…

Combinatorics · Mathematics 2018-08-03 Fengming Dong

We give two proofs that the $h$-vector of any paving matroid is a pure O-sequence, thus answering in the affirmative a conjecture made by R. Stanley, for this particular class of matroids. We also investigate the problem of obtaining good…

Combinatorics · Mathematics 2010-08-17 Criel Merino , Steven D. Noble , Marcelino Ramírez-Ibañez , Rafael Villarroel

Caffarelli's contraction theorem bounds the derivative of the optimal transport map between a log-convex measure and a strongly log-concave measure. We show that an analogous phenomenon holds on the level of the trace: The trace of the…

Analysis of PDEs · Mathematics 2025-11-26 Guido De Philippis , Yair Shenfeld

Recently, the saturation problem of $0$-$1$ matrices gained a lot of attention. This problem can be regarded as a saturation problem of ordered bipartite graphs. Motivated by this, we initiate the study of the saturation problem of ordered…

Combinatorics · Mathematics 2022-03-11 Vladimir Bošković , Balázs Keszegh

Approximation of entire functions by their pad\'e approximants has been examined in the past. It is true that generically such an approximation holds. However, examining this problem from another viewpoint, we obtain stronger generic…

Complex Variables · Mathematics 2011-05-17 G. Fournodavlos

Eigenvalues inequalities involving (log) convex/concav functions and Hermitian matrices, positive unital maps are considered. Simple proofs of Bhatia-Kittaneh inequality and Naimark dilation theorem are given.

Operator Algebras · Mathematics 2007-05-23 Jaspal Singh Aujla Jean-Christophe Bourin

In parking problems, a given number of cars enter a one-way street sequentially, and try to park according to a specified preferred spot in the street. Various models are possible depending on the chosen rule for collisions, when two cars…

Combinatorics · Mathematics 2023-09-26 Thomas Selig , Haoyue Zhu

We define covering and separation numbers for functions. We investigate their properties, and show that for some classes of functions there is exact equality of separation and covering. We provide analogues for various geometric…

Functional Analysis · Mathematics 2017-04-25 Shiri Artstein-Avidan , Boaz A. Slomka

The paper is concerned with b-metric and generalized b-metric spaces. One proves the existence of the completion of a generalized b-metric space and some fixed point results. The behavior of Lipschitz functions on b-metric spaces of…

Functional Analysis · Mathematics 2019-03-26 S. Cobzaş

Let $1\leq r\leq n$ and suppose that, when the Depth-first Search Algorithm is applied to a given rooted labelled tree on $n+1$ vertices, exactly $r$ vertices are visited before backtracking. Let $R$ be the set of trees with this property.…

Combinatorics · Mathematics 2017-03-08 Rui Duarte , António Guedes de Oliveira

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…

Combinatorics · Mathematics 2023-11-08 László Lovász

A classical result of Kahn and Saks states that given any partially ordered set with two distinguished elements, the number of linear extensions in which the ranks of the distinguished elements differ by $k$ is log-concave as a function of…

Combinatorics · Mathematics 2024-07-02 Ramon van Handel , Alan Yan , Xinmeng Zeng

A new position is introduced and studied for the convolution of log-concave functions, which may be regarded as a functional analogue of the maximum intersection position of convex bodies introduced and studied by Artstein-Avidan and Katzin…

Functional Analysis · Mathematics 2025-05-27 Steven Hoehner , Michael Roysdon

The Rota--Heron--Welsh conjecture (now a theorem of Adiprasito, Huh, and the author) asserts the log-concavity of the characteristic polynomial of matroids. We give an exposition of the Lorentzian polynomial proof following the work of…

Combinatorics · Mathematics 2025-08-13 Eric Katz

Let $W$ be an irreducible real reflection group. Armstrong, Reiner, and the author presented a model for parking functions attached to W and made three increasingly strong conjectures about these objects. The author generalized these…

Combinatorics · Mathematics 2015-05-18 Brendon Rhoades

In this paper, we study $\mathbb{A}^1$-connected varieties from log geometry point of view, and prove a criterion for $\mathbb{A}^1$-connectedness. As applications, we provide many interesting examples of $\mathbb{A}^1$-connected varieties…

Algebraic Geometry · Mathematics 2017-02-21 Qile Chen , Yi Zhu

To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other submodular setfunctions for which convergence of appropriate…

Combinatorics · Mathematics 2025-07-22 Kristóf Bérczi , Márton Borbényi , László Lovász , László Márton Tóth