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

We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…

We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our results imply the following. Let $G$ be a quasi-random $n$-vertex…

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

In this article, we focus on the error that is committed when computing the matrix logarithm using the Gauss--Legendre quadrature rules. These formulas can be interpreted as Pad\'e approximants of a suitable Gauss hypergeometric function.…

The Collatz and $abc$ conjectures, both well known and thoroughly studied, appear to be largely unrelated at first sight. We show that assuming the $abc$ conjecture true is helpful to improve the lower bound of integers initiating a…

In a previous work (arXiv:2505.05574), a summation formula for harmonic Maass forms of polynomial growth was established. In this note, we use the theory of $L$-series of harmonic Maass forms to state and prove a summation formula for such…

Motivated by the well-known conjecture of Ryser which relates maximum matchings to minimum vertex covers in $r$-partite $r$-uniform hypergraphs, Lov\'asz formulated a stronger conjecture. It states that one can always reduce the matching…

A law of large numbers and a central limit theorem are derived for linear statistics of random symmetric matrices whose on-or-above diagonal entries are independent, but neither necessarily identically distributed, nor necessarily all of…

We prove the Lefschetz hyperplane section theorem using a simpler machinery by making the observation that we can compose the Lefschetz Pencil with a Real Morse function to get a map from the variety to $\mathbb{R}$ which is "close" to…

In this paper, we prove a general Schwarz lemma at the boundary for holomorphic mappings from the polydisc to the unit ball in any dimensions. For the special case of one complex variable, the obtained results give the classic boundary…

As is well known the Complex Langevin (CL) method sometimes fails to converge or converges to the wrong limit. We identified one reason for this long ago: insufficient decay of the probability density either near infinity or near poles of…

Motivated by the Koml\'os conjecture in combinatorial discrepancy, we study the discrepancy of random matrices with $m$ rows and $n$ independent columns drawn from a bounded lattice random variable. It is known that for $n$ tending to…

We explore the connections between the linear algebra of symmetric matrices over GF(2) and the circuit theory of 4-regular graphs. In particular, we show that the equivalence relation on simple graphs generated by local complementation can…

The leverage scores of a full-column rank matrix A are the squared row norms of any orthonormal basis for range(A). We show that corresponding leverage scores of two matrices A and A + \Delta A are close in the relative sense, if they have…

A proper edge colouring of a graph is adjacent vertex distinguishing if no two adjacent vertices see the same set of colours. Using a clever application of the Local Lemma, Hatami (2005) proved that every graph with maximum degree $\Delta$…

We obtain $C^2$ a priori estimates for solutions of the nonlinear second-order elliptic equation related to the geometric problem of finding a strictly locally convex hypersurface with prescribed curvature and boundary in a space form.…

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

We provide a gentle introduction, aimed at non-experts, to Borel combinatorics that studies definable graphs on topological spaces. This is an emerging field on the borderline between combinatorics and descriptive set theory with deep…

The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive…