Related papers: Interlacing Families II: Mixed Characteristic Poly…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

Let $\mathcal F\subset 2^{[n]}$ be an $s$-uniform family such that every two distinct sets have a nonempty intersection but intersect in at most $k$ elements. By the well-known Ray-Chaudhuri--Wilson theorem, since the intersections can take…

We give simpler algebraic proofs of uniqueness for several Erd\H{o}s-Ko-Rado results, i.e., that the canonically intersecting families are the only largest intersecting families. Using these techniques, we characterize the largest partially…

We study the conjugate gradient method for solving s system of linear equations with coefficients which are measurable functions and establish the rate of convergence of this method.

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

We give a new proof of Carlitz-Wan's conjecture, previously proved by Lenstra (1995).Our proofs are natural and intuitive, and shed new insights into the study of exceptional polynomials.

We present a new proof of Witten's conjecture. The proof is based on the analysis of the relationship between intersection indices on moduli spaces of complex curves and Hurwitz numbers enumerating ramified coverings of the 2-sphere.

We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field,…

This paper contains the proof of difference counterparts of the conjectures due to Keven Kadell on symmetric and anti-symmetric Macdonald polynomials.

The mixed moments for the Askey-Wilson polynomials are found using a bootstrapping method and connection coefficients. A similar bootstrapping idea on generating functions gives a new Askey-Wilson generating function. An important special…

We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials,…

The problem of combining the evidence concerning an unknown, contained in each of $k$ Bayesian inference bases, is discussed. This can be considered as a generalization of the problem of pooling $k$ priors to determine a consensus prior.…

The coefficients of twisted Alexander polynomials of a knot induce regular functions of the $SL_2(\mathbb{C})$-character variety. We prove that the function of the highest degree has a finite value at an ideal point which gives a minimal…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We prove a formula expressing the Kerov polynomial $\Sigma_k$ as a weighted sum over the lattice of noncrossing partitions of the set $\{1,...,k+1\}$. In particular, such a formula is related to a partial order $\mirr$ on the Lehner's…

The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to…

We prove a conjecture of Gy\'arf\'as (1976), which asserts that any family of trees $T_1, \dots, T_{n}$ where each $T_k$ has $k$ vertices packs into $K_n$. We do so by translating the decomposition problem into a labeling problem, namely…

We study the crossing matrix of a braid and introduce a polynomial invariant for braid systems that is invariant under Hurwitz equivalence. As an application to the study of surface braids and surface links, we also define an invariant that…

Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…

We prove that the Alexander polynomials of certain families of alternating 4-braid knots satisfy Fox's Trapezoidal Conjecture. Moreover, we give explicit formulas for the signature and for the first 4 coefficients of the Alexander…