English
Related papers

Related papers: Arbitrary rank jumps for $A$-hypergeometric system…

200 papers

We study quadratic residue difference sets, GMW difference sets, and difference sets arising from monomial hyperovals, all of which are $(2^d-1, 2^{d-1}-1, 2^{d-2}-1)$ cyclic difference sets in the multiplicative group of the finite field…

Combinatorics · Mathematics 2007-05-23 Ronald Evans , Henk Hollmann , Christian Krattenthaler , Qing Xiang

A new method to construct algebro-geometric solutions of rank two Schlesinger systems is presented. For an elliptic curve represented as a ramified double covering of CP^1, a meromorphic differential is constructed with the following…

Algebraic Geometry · Mathematics 2015-06-23 Vladimir Dragovic , Vasilisa Shramchenko

We present a new explicit construction for expander graphs with nearly optimal spectral gap. The construction is based on a series of 2-lift operations. Let $G$ be a graph on $n$ vertices. A 2-lift of $G$ is a graph $H$ on $2n$ vertices,…

Combinatorics · Mathematics 2007-05-23 Yonatan Bilu , Nathan Linial

Let $\mathcal{X}$ be a complex projective manifold of dimension $n$ defined over the reals and let $M$ denote its real locus. We study the vanishing locus $Z\_{s\_d}$ in $M$ of a random real holomorphic section $s\_d$ of $\mathcal{E}…

Metric Geometry · Mathematics 2019-12-20 Thomas Letendre

We establish lower bounds on the rank of matrices in which all but the diagonal entries lie in a multiplicative group of small rank. Applying these bounds we show that the distance sets of finite pointsets in $\mathbb{R}^d$ generate high…

Combinatorics · Mathematics 2021-09-03 Noga Alon , Jozsef Solymosi

Let $K$ be a non-empty set of ideals of the commutative ring $R$, closed under taking smaller ideals. A subset $X$ of the group ring $R[\mathbb{Z}^s]$ is called a $K$-set if the ideal generated by the coefficients of the elements of $X$ is…

Commutative Algebra · Mathematics 2019-09-12 Thomas Huettemann , Zuhong Zhang

Motivated by problems in algebraic complexity theory (e.g., matrix multiplication) and extremal combinatorics (e.g., the cap set problem and the sunflower problem), we introduce the geometric rank as a new tool in the study of tensors and…

Computational Complexity · Computer Science 2023-04-27 Swastik Kopparty , Guy Moshkovitz , Jeroen Zuiddam

Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of…

Computational Geometry · Computer Science 2018-03-05 Karl Bringmann , Sergio Cabello , Michael T. M. Emmerich

Let $d$ be a nonnegative integer, and let $P \subset \mathbb R^d$ be a $d$-dimensional convex lattice polytope. In this article, we prove that the ratio of the volume of a normal-sized miniature of $P$ to that of $P$ is $1:\binom{2d+1}{d},$…

Combinatorics · Mathematics 2026-05-21 Takashi Hirotsu

We study the space of loops into a hypersurface complement, and show that the corresponding topological algebra of Laurent series with coefficients in $\mathcal{O}(L\mathbf{A}^{d}_{f})$ is a topological localisation of…

Algebraic Geometry · Mathematics 2022-05-23 Emile Bouaziz

Given a rational elliptic surface over a number field, we study the collection of fibers whose Mordell--Weil rank is greater than the generic rank. We give conditions on the singular fibers to assure that the collection of fibers for which…

Number Theory · Mathematics 2022-05-17 Renato Dias Costa , Cecília Salgado

We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural lifting (aka escalation) techniques. For example, we prove that even optimal rank lower bounds on $k$-tensors cannot yield non-trivial lower…

Computational Complexity · Computer Science 2019-04-10 Ankit Garg , Visu Makam , Rafael Oliveira , Avi Wigderson

We introduce a hypergoemetirc series with two complex variables, which generalizes Appell's, Lauricella's and Kemp\'e de F\'eriet's hypergeometric series, and study the system of differential equations that it satisfies. We determine the…

Classical Analysis and ODEs · Mathematics 2024-07-03 Saiei-Jaeyeong Matsubara-Heo , Toshio Oshima

In this paper, we present a significant improvement of Quick Hypervolume algorithm, one of the state-of-the-art algorithms for calculating exact hypervolume of the space dominated by a set of d-dimensional points. This value is often used…

Neural and Evolutionary Computing · Computer Science 2017-08-14 Andrzej Jaszkiewicz

For $d\ge 3$ we first show that the Hausdorff dimension of the set of $A$-divergent on average points in the $(d-1)$-dimensional closed horosphere in the space of $d$-dimensional Euclidean lattices, where $A$ is the group of positive…

Dynamical Systems · Mathematics 2024-12-13 Wooyeon Kim

The notion of the higher rank numerical range $\Lambda_{k}(L(\lambda))$ for matrix polynomials $L(\lambda)=A_{m}\lambda^{m}+...+A_{1}\lambda+A_{0}$ is introduced here and some fundamental geometrical properties are investigated. Further,…

Rings and Algebras · Mathematics 2011-04-08 Aikaterini Aretaki , John Maroulas

In this article, we conjecture exact estimates for the Weyl-invariant Opdam-Cherednik hypergeometric functions. We prove the conjecture for the root system $A_n$ and for all rank 1 cases. We provide other evidence that the conjecture might…

Classical Analysis and ODEs · Mathematics 2022-03-21 Piotr Graczyk , Patrice Sawyer

We are interested by holomorphic $d$-webs $W$ of codimension one in a complex $n$-dimensional manifold $M$. If they are ordinary, i.e. if they satisfy to some condition of genericity (whose precise definition is recalled), we proved in [CL]…

Differential Geometry · Mathematics 2017-03-13 Jean Paul Dufour , Daniel Lehmann

We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…

Combinatorics · Mathematics 2017-03-17 Roy Meshulam

We study the problem of learning a high-density region of an arbitrary distribution over $\mathbb{R}^d$. Given a target coverage parameter $\delta$, and sample access to an arbitrary distribution $D$, we want to output a confidence set $S…

Data Structures and Algorithms · Computer Science 2025-05-14 Chao Gao , Liren Shan , Vaidehi Srinivas , Aravindan Vijayaraghavan