中文
相关论文

相关论文: Some Remarks on Systems of Equiangular Lines

200 篇论文

In this article, we study extreme values of quadratic character sums with multiplicative coefficients $\sum_{n \le N}f(n)\chi_d(n)$. For a positive number $N$ within a suitable range, we employ the resonance method to establish a…

数论 · 数学 2025-08-26 Zikang Dong , Zhonghua Li , Yutong Song , Shengbo Zhao

For $e$ a positive integer, we find restrictions modulo $2^e$ on the coefficients of the characteristic polynomial $\chi_S(x)$ of a Seidel matrix $S$. We show that, for a Seidel matrix of order $n$ even (resp. odd), there are at most…

组合数学 · 数学 2019-07-23 Gary R. W. Greaves , Pavlo Yatsyna

We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance problem. A connection is used between invariants in representations of the orthogonal group and representations of the general linear group,…

度量几何 · 数学 2023-09-06 David de Laat , Fabrício Caluza Machado , Willem de Muinck Keizer

Large sets of equiangular lines are constructed from sets of mutually unbiased bases, over both the complex and the real numbers.

组合数学 · 数学 2015-03-23 Jonathan Jedwab , Amy Wiebe

We develop the theory of equiangular lines in Euclidean spaces. Our focus is on the question of when a Seidel matrix having precisely three distinct eigenvalues has a regular graph in its switching class. We make some progress towards an…

组合数学 · 数学 2019-01-31 Gary R. W. Greaves

We present a formula for the number of line segments connecting q+1 points of an n_1 x...x n_k rectangular grid. As corollaries, we obtain formulas for the number of lines through at least q points and, respectively, through exactly q…

组合数学 · 数学 2011-08-05 Pentti Haukkanen , Jorma K. Merikoski

We show that the maximum cardinality of an equiangular line system in $\mathbb R^{18}$ is at most $59$. Our proof includes a novel application of the Jacobi identity for complementary subgraphs. In particular, we show that there does not…

组合数学 · 数学 2023-09-11 Gary R. W. Greaves , Jeven Syatriadi

For an angle $\alpha\in (0,\pi)$, we consider plane graphs and multigraphs in which the edges are either (i) one-bend polylines with an angle $\alpha$ between the two edge segments, or (ii) circular arcs of central angle $2(\pi-\alpha)$. We…

离散数学 · 计算机科学 2023-11-28 Csaba D. Tóth

An $L$-spherical code is a set of Euclidean unit vectors whose pairwise inner products belong to the set $L$. We show, for a fixed $\alpha,\beta>0$, that the size of any $[-1,-\beta]\cup\{\alpha\}$-spherical code is at most linear in the…

组合数学 · 数学 2016-02-26 Boris Bukh

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

An $n$-correct set $\mathcal{X}$ in the plane is a set of nodes admitting unique interpolation with bivariate polynomials of total degree at most $n$. A $k$-node line is a line passing through exactly $k$ nodes of $\mathcal{X}.$ A line can…

数值分析 · 数学 2025-08-20 Hakop Hakopian , Gagik Vardanyan , Navasard Vardanyan

The existence of a uniform upper bound for the maximum number of limit cycles of planar piecewise linear differential systems with two zones separated by a straight line has been subject of interest of hundreds of papers. After more than 30…

动力系统 · 数学 2022-11-28 Victoriano Carmona , Fernando Fernández-Sánchez , Douglas D. Novaes

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…

组合数学 · 数学 2025-08-12 Benedek Kovács , Zoltán Lóránt Nagy , Dávid R. Szabó

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n\times n$ grid while avoiding a collinear triple. The maximum is well known to be linear in $n$. Following a question of Erde, we seek…

组合数学 · 数学 2024-11-07 Dániel T. Nagy , Zoltán Lóránt Nagy , Russ Woodroofe

We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.

组合数学 · 数学 2008-05-19 Nicolas Bartholdi , Jérémy Blanc , Sébastien Loisel

In an undirected graph, the odd cycle packing number is the maximum number of pairwise vertex-disjoint odd cycles. The odd cycle transversal number is the minimum number of vertices that hit every odd cycle. The maximum ratio between…

组合数学 · 数学 2025-12-30 Luise Puhlmann , Niklas Schlomberg

We consider real and complex equiangular lines, generated by unit vectors. We show that, for an arbitrary dimension $d$, if there exists a set of $d^2$ equiangular unit vectors in $\mathbb{C}^d$, then there must exist a set of $d^2$…

量子物理 · 物理学 2026-03-11 Igor Van Loo , Frédérique Oggier

Choose $N$ unoriented lines through the origin of ${\bf R}^{d+1}$. The sum of the angles between these lines is conjectured to be maximized if the lines are distributed as evenly as possible amongst the coordinate axes of some orthonormal…

度量几何 · 数学 2023-09-26 Tongseok Lim , Robert J. McCann

We have found maximum possible runs of consecutive positive integers each having exactly $k$ divisors for some fixed values of $k$. In addition, we exhibit the run of 10 consecutive positive integers each having exactly 12 divisors and two…

数论 · 数学 2015-10-27 Vladimir A. Letsko

This paper deals more generally with @-numbers defined as follows: Call `\textit{alpha number}' of order $(\underline{\alpha},\bar{\alpha})\in\mathbb{H}^2$, (denote its family by @$_{(\underline{\alpha},\bar{\alpha})\in\mathbb{H}^2;…

数论 · 数学 2021-05-28 Abiodun E. Adeyemi