Related papers: Lacunary matrices
We study randomly coloured graphs embedded into Euclidean space, whose vertex sets are infinite, uniformly discrete subsets of finite local complexity. We construct the appropriate ergodic dynamical systems, explicitly characterise ergodic…
We build a matrix model of a chiral [SU(N)]^K gauge theory (5D SQCD deconstructed down to 4D) using random unitary matrices to model chiral bifundamental fields (N,N-bar) (without (N-bar,N)). We verify the duality by matching the loop…
Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…
A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…
Denote by $\lambda_1(A), \ldots, \lambda_n(A)$ the eigenvalues of an $(n\times n)$-matrix $A$. Let $Z_n$ be an $(n\times n)$-matrix chosen uniformly at random from the matrix analogue to the classical $\ell_ p^n$-ball, defined as the set of…
We investigate a cancellation property satisfied by a connected Eulerian digraph $D$. Namely, unless $D$ is a single directed cycle, we have $\sum_{k\geq 1} (-1)^{k} f_k(D)=0$, where $f_k(D)$ is the number of partitions of Eulerian circuits…
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
The spectra of previously constructed auxiliary matrices for the six-vertex model at roots of unity are investigated for spin-chains of even and odd length. The two cases show remarkable differences. In particular, it is shown that for even…
A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…
We show that a family of extremely thin sets satisfy the Erd\H{o}s similarity conjecture. These examples lie outside the range covered by recent work of Shmerkin and Yavicoli \cite{ShmerkinYavicoli2025}. As we shall see, they have small…
Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…
We study the thresholds for the property of containing a solution to a linear homogeneous system in random sets. We expand a previous sparse Sz\'emeredi-type result of Schacht to the broadest class of matrices possible. We also provide a…
The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…
Given a $k$-graph $\Lambda$ and an element $p$ of $\NN^k$, we define the dual $k$-graph, $p\Lambda$. We show that when $\Lambda$ is row-finite and has no sources, the $C^*$-algebras $C^*(\Lambda)$ and $C^*(p\Lambda)$ coincide. We use this…
For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…
We give a bijection between meanders and special sorts of Gauss diagrams which aroused from the Thurston generators of braid groups. It allows us to give an algorithm to construct such diagrams and to code meanders by matrices which are…
A binary matrix has the consecutive ones property (C1P) if it is possible to order the columns so that all 1s are consecutive in every row. In [McConnell, SODA 2004 768-777] the notion of incompatibility graph of a binary matrix was…
Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…
Recently, Laplacian matrices of graphs are studied as density matrices in quantum mechanics. We continue this study and give conditions for separability of generalized Laplacian matrices of weighted graphs with unit trace. In particular, we…