相关论文: A note on the discrepancy of matrices with bounded…

The Lopsided Lov\'{a}sz Local Lemma (LLLL) is a powerful probabilistic principle which has been used in a variety of combinatorial constructions. While originally a general statement about probability spaces, it has recently been…

This article discusses classical versions of the Schwarz lemma at the boundary of the unit disk in the complex plane. The exposition includes commentary on the history, the mathematics, and the applications.

In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…

We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between its endpoints increases. The main focus of this work is a…

We reveal a connection between the incompressibility method and the Lovasz local lemma in the context of Ramsey theory. We obtain bounds by repeatedly encoding objects of interest and thereby compressing strings. The method is demonstrated…

We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…

Moser and Tardos (2010) gave an algorithmic proof of the lopsided Lov\'asz local lemma (LLL) in the variable framework, where each of the undesirable events is assumed to depend on a subset of a collection of independent random variables.…

This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…

The problem of uniformly sampling hypergraph independent sets is revisited. We design an efficient perfect sampler for the problem under a condition similar to that of the asymmetric Lov\'asz Local Lemma. When applied to $d$-regular…

We study a fourth-order derivative scalar field configuration in a fixed Lifshitz background. Using an auxiliary field we rewrite the equations of motion as two coupled second order equations. We specialize to the limit that the mass of the…

A $t-\a$ covering array is an $m\times n$ matrix, with entries from an alphabet of size $\alpha$, such that for any choice of $t$ rows, and any ordered string of $t$ letters of the alphabet, there exists a column such that the "values" of…

We show a simple method for constructing larger matrices but preserving the spectral radius. This yields a sufficient criteria for two square matrices of arbitrary dimension have the same spectral radius, a way to compare spectral radii of…

Extending earlier work of Killip-Simon and Simon-Zlatos, we obtain sum rules for Jacobi matrices in which the a.c. part of the spectral measure and the eigenvalues of the matrix appear on opposite sides of the equation. We use these to…

A Lefschetz formula is given that relates loops in a regular finite graph to traces of a certain representation. As an application the poles of the Ihara/Bass zeta function are expressed as dimensions of global section spaces of locally…

Every sufficiently big matrix with small spectral norm has a nearby low-rank matrix if the distance is measured in the maximum norm (Udell & Townsend, SIAM J Math Data Sci, 2019). We use the Hanson--Wright inequality to improve the estimate…

A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper some variations are considered. First, recall their theorem, which gives bounds on the sum and…

This is the first of a series of papers that develop a systematic bridge between constructions in discrete mathematics and the corresponding continuous analogs. In this paper, we establish an equivalence between Forman's discrete Morse…

Motivated by the Erd\H{o}s-Faber-Lov\'{a}sz (EFL) conjecture for hypergraphs, we consider the list edge coloring of linear hypergraphs. We show that if the hyper-edge sizes are bounded between $i$ and $C_{i,\epsilon} \sqrt{n}$ inclusive,…

Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…

Let $G$ be a simple graph with the Laplacian matrix $L(G)$ and let $e(G)$ be the number of edges of $G$. A conjecture by Brouwer and a conjecture by Grone and Merris state that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at…