Related papers: A combinatorial approach to nonlinear spectral gap…
In this paper, our objective is to present a constraining principle governing the spectral properties of the sample covariance matrix. This principle exhibits harmonious behavior across diverse limiting frameworks, eliminating the need for…
We show that, for one-dimensional discrete Schr\"odinger operators, stability of Anderson localization under a class of rank one perturbations implies absence of intervals in spectra. The argument is based on well-known result of Gordon and…
Building on B.Park and Vondrak's recent generalization of the J.Park-Pham Theorem (formerly known as Kahn-Kalai conjecture) to non-uniform probability measures, this paper introduces the notion of "spread" for the non-uniform setting. This…
In this dissertation, we show that the Central Limit Theorem and the Invariance Principle for Discrete Fourier Transforms discovered by Peligrad and Wu can be extended to the quenched setting. We show that the random normalization…
We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…
In this paper we prove Poincar\'e inequalities for the Discrete de Rham (DDR) sequence on a general connected polyhedral domain $\Omega$ of $\mathbb{R}^3$. We unify the ideas behind the inequalities for all three operators in the sequence,…
We study the problem of learning a directed acyclic graph from data generated according to an additive, non-linear structural equation model with Gaussian noise. We express each non-linear function through a basis expansion, and derive a…
Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimodular graphs over finite fields and, more generally, over finite valuation rings. We compute the spectrum of the unimodular graphs, by using…
It was shown by G. Pisier that any finite-dimensional normed space admits an $\alpha$-regular $M$-position, guaranteeing not only regular entropy estimates but moreover regular estimates on the diameters of minimal sections of its unit-ball…
We initiate a systematic study of non-planar on-shell diagrams in N=4 SYM and develop powerful technology for doing so. We introduce canonical variables generalizing face variables, which make the dlog form of the on-shell form explicit. We…
The main result of this paper supports a conjecture by C. P\'erez and E. Rela about a very recent result of theirs on self-improving theory. Also, we extend the conclusions of their theorem to the range $p<1$. As an application of our…
We address the study of nonlocal gradients defined through general radial kernels $\rho$. Our investigation focuses on the properties of the associated function spaces, which depend on the characteristics of the kernel function.…
A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…
High energy diffraction and soft QCD span exciting final state topologies and fluctuations which have not yet been measured or characterized in a fully exhaustive way. In this work, we go beyond the standard measures and formulate a new…
We derive several upper bounds on the spectral gap of the Laplacian with standard or Dirichlet vertex conditions on compact metric graphs. In particular, we obtain estimates based on the length of a shortest cycle (girth), diameter, total…
In this paper, we obtain stability results for the $L^{p}$-Poincar\'e inequality for both Lebesgue and Gaussian probability measures (Theorem 3.3 and Theorem 3.13) that involve explicit dependence on the geometry of the domain. As a…
There is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial "refinement" algorithms seem to be very efficient in practice. Some philosophical justification is provided by a classical theorem of…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
We study Fourier bases on invariant measures generated by affine iterated function systems in ${\mathbb R}^d$ with integer coefficients. We show that, for simple digit sets, these systems satisfy the open set condition and have no overlap.…