English
Related papers

Related papers: A refined Gallai-Edmonds structure theorem for wei…

200 papers

In a companion paper [On semiclassical orthogonal polynomials via polynomial mappings, J. Math. Anal. Appl. (2017)] we proved that the semiclassical class of orthogonal polynomials is stable under polynomial transformations. In this work we…

Classical Analysis and ODEs · Mathematics 2020-05-20 K. Castillo , M. N. de Jesus , J. Petronilho

In two dimensions, Gallagher's theorem is a strengthening of the Littlewood conjecture that holds for almost all pairs of real numbers. We prove an inhomogeneous fibre version of Gallagher's theorem, sharpening and making unconditional a…

Number Theory · Mathematics 2018-07-18 Sam Chow

We investigate the structure of graded commutative exponential functors. We give applications of these structure results, including computations of the homology of the symmetric groups and of extensions in the category of strict polynomial…

K-Theory and Homology · Mathematics 2020-02-18 Antoine Touzé

We generalize R. P. Stanley's celebrated theorem that the $h^\ast$-polynomial of the Ehrhart series of a rational polytope has nonnegative coefficients and is monotone under containment of polytopes. We show that these results continue to…

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…

Combinatorics · Mathematics 2024-12-24 Fern Gossow

Recently we have shown a structure theorem for locally compact groups of polynomial growth. We give now some applications on various growth functions and relations to FC-G - series. In addition, we show some results on related classes of…

Group Theory · Mathematics 2021-04-27 Viktor Losert

A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximum cardinality is a well-solved problem, it is NP-hard to…

Discrete Mathematics · Computer Science 2024-08-12 Phillippe Samer , Phablo F. S. Moura

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin

The duality theorem of Lass relates the matching polynomials of a simple graph $G$ with the matching polynomials of its complement $\bar G$. In particular, this relation gives rise to Godsil's result, which offers a nice interpretation of…

Combinatorics · Mathematics 2025-12-18 Medet Jumadildayev

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

Algebraic Geometry · Mathematics 2024-10-24 Antoine Etesse

We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials,…

Combinatorics · Mathematics 2010-08-17 Lily L. Liu , Yi Wang

We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…

Dynamical Systems · Mathematics 2012-12-07 Artur Siemaszko , Maciej P. Wojtkowski

We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…

Classical Analysis and ODEs · Mathematics 2015-10-27 Kirill A. Kopotun

We introduce a new family of polynomials, crystal skeleton polynomials, to better understand enumeration of standard Young tableaux, quasi-Yamanouchi tableaux and interactions with Gessel's expansion of a Schur function, quasi-crystals and…

Combinatorics · Mathematics 2025-12-09 Masato Kobayashi

We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…

Classical Analysis and ODEs · Mathematics 2026-04-29 Kerstin Jordaan , Vikash Kumar

Recently Galashin, Grinberg, and Liu introduced the refined dual stable Grothendieck polynomials, which are symmetric functions in $x=(x_1,x_2,\dots)$ with additional parameters $t=(t_1,t_2,\dots)$. The refined dual stable Grothendieck…

Combinatorics · Mathematics 2020-09-17 Jang Soo Kim

Consider random polynomials of the form $G_n = \sum_{i=0}^n \xi_i p_i$, where the $\xi_i$ are i.i.d.\ non-degenerate complex random variables, and $\{p_i\}$ is a sequence of orthonormal polynomials with respect to a regular measure $\tau$…

Probability · Mathematics 2021-10-29 Duncan Dauvergne

We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…

Combinatorics · Mathematics 2018-05-08 David G. L. Wang , Jiarui Zhang

An explicit structure relation for Askey-Wilson polynomials is given. This involves a divided q-difference operator which is skew symmetric with respect to the Askey-Wilson inner product and which sends polynomials of degree n to…

Classical Analysis and ODEs · Mathematics 2009-10-31 Tom H. Koornwinder

We give direct and inverse theorems for the weighted approximation of functions with inner singularities by combinations of Bernstein polynomials.

Functional Analysis · Mathematics 2011-04-25 Wen-Ming Lu , Lin Zhang