Related papers: Interlacing Families II: Mixed Characteristic Poly…

We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for…

We propose several procedures for creating new families of integer sequences based on the method of Cantor diagonalization. Then we modify and generalize this method. The paper includes explicit formulas for most proposed families of…

In this paper we survey a recent progress on continuous frames inspired by the solution of the Kadison-Singer problem by Marcus, Spielman, and Srivastava. We present an extension of Lyapunov's theorem for discrete frames due to Akemann and…

In 1984, Wilson proved the Erd\H{o}s-Ko-Rado theorem for $t$-intersecting families of $k$-subsets of an $n$-set: he showed that if $n\ge(t+1)(k-t+1)$ and $\mathcal{F}$ is a family of $k$-subsets of an $n$-set such that any two members of…

We study one-dimensional algebraic families of pairs given by a polynomial with a marked point. We prove an "unlikely intersection" statement for such pairs thereby exhibiting strong rigidity features for these pairs. We infer from this…

Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…

A new method of connecting two wavelet sets with a continuous path of wavelet sets is given. The method is based on a pure set theoretic fact known as the Schroder-Cantor-Bernstein theorem and on a characterization of wavelet sets in terms…

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

We construct a version of kneading theory for families of monotonous functions on the real line. The generality of the setup covers two classical results from Milnor-Thurston's kneading theory: the first one is to dynamically characterise…

Kalfagianni and Lee found two-sided bounds for the crosscap number of an alternating link in terms of certain coefficients of the Jones polynomial. We show here that we can find similar two-sided bounds for the crosscap number of Conway…

We consider matrix orthogonal polynomials related to Jacobi type matrices of weights that can be defined in terms of a given matrix Pearson equation. Stating a Riemann-Hilbert problem we can derive first and second order differential…

We revisit and generalize the concept of composite likelihood as a method to make a probabilistic inference by aggregation of multiple Bayesian agents, thereby defining a class of predictive models which we call composite Bayesian. This…

We prove K-theoretic generalizations of the component formulas of Knutson, Miller, and Shimozono, and deduce that K-theoretic quiver coefficients have alternating signs. We also prove new variants of the factor sequences conjecture, and a…

We give combinatorially controlled series solutions to Dyson--Schwinger equations with multiple insertion places using tubings of rooted trees and investigate the algebraic relation between such solutions and the renormalization group…

Let $\mathrm{pm}(G)$ denote the number of perfect matchings of a graph $G$, and let $K_{r\times 2n/r}$ denote the complete $r$-partite graph where each part has size $2n/r$. Johnson, Kayll, and Palmer conjectured that for any perfect…

We introduce a new problem on the elementary symmetric polynomials $\sigma_k$, stemming from the constraint equations of some modified gravity theory. For which coefficients is a linear combination of $\sigma_k$ $1/p$-concave, with $0 \leq…

Given k similarity classes of invertible matrices, the Deligne-Simpson problem asks to determine whether or not one can find matrices in these classes whose product is the identity and with no common invariant subspace. The first author…

In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…

Chv\'{a}tal conjectured that a star is amongst the largest intersecting subfamiles of a finite subset-closed family of sets. Kleitman later strengthened Chv\'{a}tal's conjecture, suggesting that maximal intersecting subfamilies of $2^{[n]}$…

There are many generalizations of the Erd\H{o}s-Ko-Rado theorem. We give new results (and problems) concerning families of $t$-intersecting $k$-element multisets of an $n$-set and point out connections to coding theory and classical…