Related papers: Equiangular lines via improved eigenvalue multipli…
A bipartite graph $G = (X \cup Y, E)$ is a 2-layer $k$-planar graph if it admits a drawing on the plane such that the vertices in $X$ and $Y$ are placed on two parallel lines respectively, edges are drawn as straight-line segments, and…
Symmetric Jack polynomials arise naturally in several contexts, including statistics, physics, combinatorics, and representation theory. They are pairwise orthogonal with repsect to two different inner products, the first defined by…
This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…
It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann {\zeta} function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from…
In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…
We formulate an equivariant conservation of number, which proves that a generalized Euler number of a complex equivariant vector bundle can be computed as a sum of local indices of an arbitrary section. This involves an expansion of the…
Recently [Karimipour and Memarzadeh, Phys. Rev. A 73, 012329 (2006)] studied the problem of finding a family of orthonormal bases in a bipartite space each of dimension $D$ with the following properties: (i) The family continuously…
The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…
This paper surveys the main results obtained during the period 1992-1999 on three aspects mentioned at the title. The first result is a new and general variational formula for the lower bound of spectral gap (i.e., the first non-trivial…
The equation $x^2 + 1 = 0\mod p$ has solutions whenever $p = 2$ or $4n + 1$. A famous theorem of Fermat says that these primes are exactly the ones that can be described as a sum of two squares. That the roots of the former equation are…
Almost $50$ years ago Erd\H{o}s and Purdy asked the following question: Given $n$ points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three…
The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…
Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…
We consider a generalized angle in complex normed vector spaces. Its definition corresponds to the definition of the well known Euclidean angle in real inner product spaces. Not surprisingly it yields complex values as `angles'. This…
Bollob\'as and Nikiforov [J. Combin. Theory, Ser. B. 97 (2007) 859--865] conjectured the following. If $G$ is a $K_{r+1}$-free graph on at least $r+1$ vertices and $m$ edges, then $\lambda^2_1(G)+\lambda^2_2(G)\leq \frac{r-1}{r}\cdot2m$,…
We present a formal version of the numbers of vertices, edges, and faces for infinite planar regular triangular meshes of degree r>6. These numbers are defined via Euler summation of sequences obtained from iterated expansions of a convex…
In this paper is studied the problem concerning the angle between two subspaces of arbitrary dimensions in Euclidean space $E_{n}$. It is proven that the angle between two subspaces is equal to the angle between their orthogonal subspaces.…
In this paper, we discuss maximality of Seidel matrices with a fixed largest eigenvalue. We present a classification of maximal Seidel matrices of largest eigenvalue $3$, which gives a classification of maximal equiangular lines in a…
Let $\mathcal{R}$ be a family of axis-parallel rectangles in the plane. The transversal number $\tau(\mathcal{R})$ is the minimum number of points needed to pierce all the rectangles. The independence number $\nu(\mathcal{R})$ is the…
In this paper, we obtain a sharp upper bound for the sum of the first $k$-th eigenvalues for this Dirichlet problem of poly-Laplacian with any order, which is viewed as an extension of the result due to Cheng and Wei (Journal of…