English
Related papers

Related papers: Some Remarks on Systems of Equiangular Lines

200 papers

The classical Eulerian Numbers $A_{n,k}$ are known to be log-concave. Let $P_{n,k}$ and $Q_{n,k}$ be the number of even and odd permutations with $k$ excedances. In this paper, we show that $P_{n,k}$ and $Q_{n,k}$ are log-concave. For this,…

Combinatorics · Mathematics 2020-10-21 Hiranya Kishore Dey

We prove bounds for multilinear operators on $\R^d$ given by multipliers which are singular along a $k$ dimensional subspace. The new case of interest is when the rank $k/d$ is not an integer. Connections with the concept of {\em true…

Classical Analysis and ODEs · Mathematics 2009-04-09 Ciprian Demeter , Malabika Pramanik , Christoph Thiele

We study the maximum number of quads among $\ell$ cards from an EvenQuads deck of size $2^n$. This corresponds to enumerating quadruples of integers in the range $[0,\ell-1]$ such that their bitwise XOR is zero. In this paper, we conjecture…

We give an explicit formula for the expectation of the number of real lines on a random invariant cubic surface, i.e. a surface $Z\subset \mathbb{R}P^3$ defined by a random gaussian polynomial whose probability distribution is invariant…

Algebraic Geometry · Mathematics 2025-06-02 Rida Ait El Manssour , Mara Belotti , Chiara Meroni

We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.

Number Theory · Mathematics 2020-12-29 Tomohiro Yamada

How many points can be placed in an $n\times n$ grid so that every (affine) line contains at most $k$ points? We prove that for $n \ge k \ge 10^{37}$ the maximum number of points is exactly $kn$. Our proof builds on the recent work of…

Combinatorics · Mathematics 2025-10-21 Alexandr Grebennikov , Matthew Kwan

We derive sharp upper and lower bounds for the pointwise concentration function of the maximum statistic of $d$ identically distributed real-valued random variables. Our first main result places no restrictions either on the common marginal…

Statistics Theory · Mathematics 2025-08-04 Matias D. Cattaneo , Ricardo P. Masini , William G. Underwood

In a recent preprint on arXiv Roland Bacher showed that the number $p_d$ of non-similar perfect $d$-dimensional quadratic forms satisfies $e^{\Omega(d)} < p_d < e^{O(d^3\log(d))}$. We improve the upper bound to $e^{O(d^2\log(d))}$ by a…

Number Theory · Mathematics 2020-11-17 Wessel P. J. van Woerden

We answer a 15-year-old open question about the exact upper bound for bivariate copulas with a given diagonal section by giving an explicit formula for this bound. As an application, we determine the maximal asymmetry of bivariate copulas…

Probability · Mathematics 2024-03-28 Damjana Kokol Bukovšek , Blaž Mojškerc , Nik Stopar

Let $E^n$ denote the (real) $n$-dimensional Euclidean space. It is not known whether an equilateral set in the $\ell_1$ sum of $E^a$ and $E^b$, denoted here as $E^a \oplus_1 E^b$, has maximum size at least $\dim(E^a \oplus_1 E^b) + 1 = a +…

Metric Geometry · Mathematics 2018-11-13 Aaron Lin

Let $d$ be a positive integer. Let $p$ be a prime number. Let $\alpha$ be a real algebraic number of degree $d+1$. We establish that there exist a positive constant $c$ and infinitely many algebraic numbers $\xi$ of degree $d$ such that…

Number Theory · Mathematics 2015-05-13 Yann Bugeaud , Bernard De Mathan

It is proved that for the top Lyapunov exponent of a random matrix system of the form $\{A D(\omega)\}$, where $A$ is a nonnegative matrix and $D(\omega)$ is a diagonal matrix with positive diagonal entries, is bounded from below by the top…

Dynamical Systems · Mathematics 2017-05-09 Janusz Mierczyński

We give a hierarchy of $k$-point bounds extending the Delsarte-Goethals-Seidel linear programming $2$-point bound and the Bachoc-Vallentin semidefinite programming $3$-point bound for spherical codes. An optimized implementation of this…

Optimization and Control · Mathematics 2022-06-30 David de Laat , Fabrício Caluza Machado , Fernando Mário de Oliveira Filho , Frank Vallentin

This is the first part of a series of papers devoted to the study of linear cocycles over chaotic systems. In the present paper, we establish the existence of such cocycles that $\mathcal{C}^\alpha$-stably exhibit fiberwise bounded orbits…

Dynamical Systems · Mathematics 2024-12-30 Meysam Nassiri , Hesam Rajabzadeh , Zahra Reshadat

We consider copulas with a given diagonal section and compute the explicit density of the unique optimal copula which maximizes the entropy. In this sense, this copula is the least informative among the copulas with a given diagonal…

Statistics Theory · Mathematics 2013-12-19 Cristina Butucea , Jean-François Delmas , Anne Dutfoy , Richard Fischer

In this paper we consider the limit cycles of the planar system $$\frac{d}{dt}(x,y)=\mathbf X_n+\mathbf X_m, $$ where $\mathbf X_n$ and $\mathbf X_m$ are quasi-homogeneous vector fields of degree $n$ and $m$ respectively. We prove that…

Classical Analysis and ODEs · Mathematics 2017-08-30 Jianfeng Huang , Haihua Liang

We show that the maximal number of (real) lines in a (real) nonsingular spatial quartic surface is 64 (respectively, 56). We also give a complete projective classification of all quartics containing more than 52 lines: all such quartics are…

Algebraic Geometry · Mathematics 2017-06-20 Alex Degtyarev , Ilia Itenberg , Ali Sinan Sertöz

Let $P(x):=a_d x^d+\cdots+a_0\in\mathbb{Q}[x]$, $a_d>0$, be a polynomial of degree $d\geq 2$. Let $(x_n)$ be a sequence of integers satisfying \begin{equation*} x_{n+1}=P(x_n)\mbox{for all}\quad n=0,1,2\ldots,\quad\mbox{and} \quad…

Number Theory · Mathematics 2023-12-20 Veekesh Kumar

A spherical $L$-code, where $L \subseteq [-1,\infty)$, consists of unit vectors in $\mathbb{R}^d$ whose pairwise inner products are contained in $L$. Determining the maximum cardinality $N_L(d)$ of an $L$-code in $\mathbb{R}^d$ is a…

Combinatorics · Mathematics 2023-12-01 Saba Lepsveridze , Aleksandre Saatashvili , Yufei Zhao

We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\"offler, and Pach (2012) and almost matches the…

Metric Geometry · Mathematics 2017-08-10 Adrian Dumitrescu , Csaba D. Tóth