Related papers: Interlacing Families II: Mixed Characteristic Poly…
The Kadison-Singer Conjecture, as proved by Marcus, Spielman, and Srivastava (MSS) [Ann. Math. 182, 327-350 (2015)], has been informally thought of as a strengthening of Batson, Spielman, and Srivastava's theorem that every undirected graph…
We show an extension of a probabilistic result of Marcus, Spielman, and Srivastava, which resolved the Kadison-Singer problem, for block diagonal positive semidefinite random matrices. We use this result to show several selector results,…
Anderson's paving conjectures are known to be equivalent to the Kadison-Singer problem. We prove some new equivalences of Anderson's conjectures that require the paving of smaller sets of matrices. We prove that if the strictly upper…
The purpose of this article is to study the relation between combinatorial equivalence and topological conjugacy, specifically how a certain type of combinatorial equivalence implies topological conjugacy. We introduce the concept of…
We study the problem of approximating the largest root of a real-rooted polynomial of degree $n$ using its top $k$ coefficients and give nearly matching upper and lower bounds. We present algorithms with running time polynomial in $k$ that…
We study the inverse problem in the theory of (standard) orthogonal polynomials involving two polynomials families $(P_n)_n$ and $(Q_n)_n$ which are connected by a linear algebraic structure such as $$P_n(x)+\sum_{i=1}^N…
We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…
The celebrated Mason's conjecture states that the sequence of independent set numbers of any matroid is log-concave, and even ultra log-concave. The strong form of Mason's conjecture was independently solved by Anari, Liu, Oveis Gharan and…
In a recent work, R. Pandharipande, J. P. Solomon and the second author have initiated a study of the intersection theory on the moduli space of Riemann surfaces with boundary. They conjectured that the generating series of the intersection…
We study the following $\mathsf{KS}_2(c)$ problem: let $c \in\mathbb{R}^+$ be some constant, and $v_1,\ldots, v_m\in\mathbb{R}^d$ be vectors such that $\|v_i\|^2\leq \alpha$ for any $i\in[m]$ and $\sum_{i=1}^m \langle v_i, x\rangle^2 =1$…
We consider a problem of maximizing the product of the sizes of two uniform cross-$t$-intersecting families of sets. We show that the value of this maximum is at most polynomially larger (in the size of a ground set) than a quantity…
We give a new demonstration of Loewner's characterization of polynomials, solving in the positive a conjecture proposed by Laird and McCann in 1984.
Pairs of consecutive integers have the same height in the Collatz problem with surprising frequency. Garner gave a conjectural family of conditions for exactly when this occurs. Our main result is an infinite family of counterexamples to…
Full likelihood inference under Kingman's coalescent is a computationally challenging problem to which importance sampling (IS) and the product of approximate conditionals (PAC) method have been applied successfully. Both methods can be…
We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…
A family X of sets is said to be intersecting if any two members of X have non-empty intersection. It is a well-known and simple fact that an intersecting family of subsets of [n]={1,2,...,n} can contain at most 2^(n-1) sets. Katona, Katona…
A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \in \mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) -…
We present randomized algorithms for some well-studied, hard combinatorial problems: the k-path problem, the p-packing of q-sets problem, and the q-dimensional p-matching problem. Our algorithms solve these problems with high probability in…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
We consider Koornwinder's method for constructing orthogonal polynomials in two variables from orthogonal polynomials in one variable. If semiclassical orthogonal polynomials in one variable are used, then Koornwinder's construction…