Related papers: On Uniform Connectivity of Algebraic Matrix Sets

This paper provides a necessary and sufficient condition for a random network with nodes Poissonly distributed on a unit square and a pair of nodes directly connected following a generic random connection model to be asymptotically almost…

Let \( m, n \in \mathbb{N}_0 \), and let \( X \) be a closed subset of \( \mathbb{T}^{\binom{m+n}{2}} \). We define \( C^{m,n}_X \) to be the universal \( C^* \)-algebra among those generated by \( m \) unitaries and \( n \) isometries…

We study general quantum integrable Hamiltonians linear in a coupling constant and represented by finite NxN real symmetric matrices. The restriction on the coupling dependence leads to a natural notion of nontrivial integrals of motion and…

Let $\textrm{Mat}_2(\mathbb{R})$ be the set of $2 \times 2$ matrices with real entries. For any $\varepsilon>0$ and any finitely--supported probability measure $\mu$ on $\textrm{Mat}_2(\mathbb{R})$, we prove that either \[ T(\mu) = \sum_{X,…

Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…

Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…

The set of all m-tuples of compatible full conditional distributions on discrete random variables is an algebraic set whose defining ideal is a unimodular toric ideal. We identify the defining polynomials of these ideals with closed walks…

The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…

In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all…

In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect the remaining nodes from each other. It is closely related…

Let $G$ be a graph such that, whenever two vertices $x$ and $y$ of $G$ are joined by three internally disjoint paths, $x$ and $y$ are adjacent. Jamison and Mulder determined that the set of such graphs coincides with the set of graphs that…

These lecture notes are a concise introduction of recent techniques to prove local spectral universality for a large class of random matrices. The general strategy is presented following the recent book with H.T. Yau. We extend the scope of…

Resolving a conjecture of von Neumann, Ogata's theorem in arXiv:1111.5933 showed the highly nontrivial result that arbitrarily many matrices corresponding to macroscopic observables with $N$ sites and a fixed site dimension $d$ are…

We consider uniformly (DC) or periodically (AC) driven generalized infinite elastic chains (a generalized Frenkel-Kontorova model) with gradient dynamics. We first show that the union of supports of all the invariant measures, denoted by A,…

This note is about uniform, plane, singly connected, regular Hall-plates with an arbitrary number of contacts exposed to a uniform magnetic field of arbitrary strength. In practice, the regular symmetry is the most common one. If the…

The planar-diagrammatic technique of large-$N$ random matrices is extended to evaluate averages over the circular ensemble of unitary matrices. It is then applied to study transport through a disordered metallic ``grain'', attached through…

We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for…

We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient…

We consider the variety of $(p+1)$-tuples of matrices $M_j$ from given conjugacy classes from $GL(n,{\bf C})$ such that $M_1... M_{p+1}=I$. This variety is connected with the Deligne-Simpson problem and the matrices $M_j$ are interpreted as…

In this paper we show that every sufficiently large family of convex bodies in the plane has a large subfamily in convex position provided that the number of common tangents of each pair of bodies is bounded and every subfamily of size five…