English
Related papers

Related papers: Enumeration of Seidel matrices

200 papers

Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…

Mathematical Physics · Physics 2015-01-20 A. B. J. Kuijlaars

In this paper we study ensembles of random symmetric matrices $\X_n = {X_{ij}}_{i,j = 1}^n$ with dependent entries such that $\E X_{ij} = 0$, $\E X_{ij}^2 = \sigma_{ij}^2$, where $\sigma_{ij}$ may be different numbers. Assuming that the…

Probability · Mathematics 2013-03-19 F. Götze , A. Naumov , A. Tikhomirov

An $L$-matrix is a matrix whose off-diagonal entries belong to a set $L$, and whose diagonal is zero. Let $N(r,L)$ be the maximum size of a square $L$-matrix of rank at most $r$. Many applications of linear algebra in extremal combinatorics…

Commutative Algebra · Mathematics 2016-08-22 Boris Bukh

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

Algebraic Geometry · Mathematics 2007-05-23 Steven Kleiman , Ragni Piene

Line systems passing through the origin of the $d$ dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least $2(d-1)(d-2)$, and this…

Metric Geometry · Mathematics 2019-10-15 Mikhail Ganzhinov , Ferenc Szöllősi

The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…

Combinatorics · Mathematics 2025-11-25 Harishchandra S. Ramane , B. Parvathalu , Daneshwari Patil , K. Ashoka

Jiang, Tidor, Yao, Zhang, and Zhao recently showed that connected bounded degree graphs have sublinear second eigenvalue multiplicity (always referring to the adjacency matrix). This result was a key step in the solution to the problem of…

Combinatorics · Mathematics 2023-02-23 Milan Haiman , Carl Schildkraut , Shengtong Zhang , Yufei Zhao

We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Gr\"unbaums catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines,…

Combinatorics · Mathematics 2011-08-16 Michael Cuntz

Recently, Brualdi and Cao studied $I_k$-avoiding $(0,1)$-matrices by decomposing them into zigzag paths and proved that the maximum number of $1$'s in such a matrix is given by an exact formula. We further study the structure of maximal…

Combinatorics · Mathematics 2026-05-06 Sen-Peng Eu , Yi-Lin Lee

We introduce the notion of p-adic equiangular lines and derive the first fundamental relation between common angle, dimension of the space and the number of lines. More precisely, we show that if $\{\tau_j\}_{j=1}^n$ is p-adic…

Combinatorics · Mathematics 2025-07-25 K. Mahesh Krishna

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…

Combinatorics · Mathematics 2007-05-23 Miodrag Živković

We classify perimeter dominant triangles whose side lengths are in $\sqrt3\mathbb N$ and whose area is in $\frac{\sqrt3}4\mathbb N$. There is one exceptional example, which is equilateral, and three infinite families determined by certain…

Combinatorics · Mathematics 2023-12-19 Christian Aebi , Grant Cairns

The paper is devoted to multidimensional $(0,1)$-matrices extremal with respect to containing a polydiagonal (a fractional generalization of a diagonal). Every extremal matrix is a threshold matrix, i.e., an entry belongs to its support…

Combinatorics · Mathematics 2023-11-17 Anna A. Taranenko

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…

Rings and Algebras · Mathematics 2017-03-20 Andrii Dmytryshyn , Froilan M. Dopico

In the first part of these notes, we review some of the recent developments in the study of the spectral properties of Wigner matrices. In the second part, we present a new proof of a Wegner estimate for the eigenvalues of a large class of…

Mathematical Physics · Physics 2011-03-09 Anna Maltsev , Benjamin Schlein

We deal with connected $k$-regular multigraphs of order $n$ that has only three distinct eigenvalues. In this paper, we study the largest possible number of vertices of such a graph for given $k$. For $k=2,3,7$, the Moore graphs are…

Combinatorics · Mathematics 2019-04-11 Hiroshi Nozaki

In this paper, we study the restrictions on the number $m$ of conic-line curves in special pencils. The most general result we obtain is the relation between upper bounds on $m$ and the number $p$ of concurrent lines in these pencils. We…

Algebraic Geometry · Mathematics 2026-05-25 Hasan Suluyer

It is known that there are infinitely many exceptional sequences of quiver representations for Euclidean quivers. In this paper we study those of type $\tilde{\mathbb{A}}_n$ and classify them into finitely many parametrized families. We…

Representation Theory · Mathematics 2023-06-02 Ray Maresca

We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the…

Probability · Mathematics 2007-12-12 Charles Bordenave

It is critical to understand the properties of spatial correlation matrices in massive multiple-input multiple-output (MIMO) systems. We derive new bounds on the extreme eigenvalues of a spatial correlation matrix that is characterized by…

Information Theory · Computer Science 2014-06-23 Junil Choi , David J. Love
‹ Prev 1 3 4 5 6 7 10 Next ›