Related papers: Cauchy-Davenport Theorem for linear maps: Simplifi…
In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized…
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…
Let W be a projective variety of dimension n+1, L a free line bundle on W, X in $H^0(L^d)$ a hypersurface of degree d which is generic among those given by sums of monomials from $L$, and let $f : Y \to X$ be a generically finite map from a…
In recent years there has been increased interest in extremal problems for "counting" parameters of graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. In the same…
The escalating parameter counts in modern deep learning models pose a fundamental challenge to efficient training and resolution of overfitting. We address this by introducing the \emph{Mapping Networks} which replace the high dimensional…
We provide proofs certifying that the structure theorem for vertex sets of bounded bidimensionality holds with polynomial bounds. The bidimensionality of vertex sets is a common generalisation of both treewidth and the face-cover-number of…
For quantum systems described by finite matrices, linear and affine maps of matrices are shown to provide equivalent descriptions of evolution of density matrices for a subsystem caused by unitary Hamiltonian evolution in a larger system;…
We prove the multiplicity one theorem for min-max free boundary minimal hypersurfaces in compact manifolds with boundary of dimension between 3 and 7 for generic metrics. To approach this, we develop existence and regularity theory for free…
The purpose of this paper is finding the essential attributes underlying the convexity theorems for momentum maps. It is shown that they are of topological nature; more specifically, we show that convexity follows if the map is open onto…
Brehm's extension theorem states that a non-expansive map on a finite subset of a Euclidean space can be extended to a piecewise-linear map on the entire space. In this note, it is verified that the proof of the theorem is constructive…
A theorem by Ding, Oporowski, Oxley, and Vertigan states that every sufficiently large bipartite graph without twins contains a matching, co-matching, or half-graph of any given size as an induced subgraph. We prove that this Ramsey…
We give combinatorial generalizations of the Cayley-Bacharach theorem and induced map.
We prove essentially sharp bounds for Ramsey numbers of ordered hypergraph matchings, inroduced recently by Dudek, Grytczuk, and Ruci\'{n}ski. Namely, for any $r \ge 2$ and $n \ge 2$, we show that any collection $\mathcal H$ of $n$ pairwise…
A lower bound on the chromatic number of a graph is derived by majorization of spectra of weighted adjacency matrices. These matrices are given by Hadamard products of the adjacency matrix and arbitrary Hermitian matrices.
We study the Cauchy problem for the nonlinear damped wave equation and establish the large data local well-posedness and small data global well-posedness with slowly decaying initial data. We also prove that the asymptotic profile of the…
In this paper, we theoretically prove that gradient descent can find a global minimum of non-convex optimization of all layers for nonlinear deep neural networks of sizes commonly encountered in practice. The theory developed in this paper…
We provide a new lower bound on the minimum distance of a family of quantum LDPC codes based on Cayley graphs proposed by MacKay, Mitchison and Shokrollahi. Our bound is exponential, improving on the quadratic bound of Couvreur, Delfosse…
This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…
We discuss upper and lower bounds for the size of gaps in the length spectrum of negatively curved manifolds. For manifolds with algebraic generators for the fundamental group, we establish the existence of exponential lower bounds for the…