Related papers: Lower bounds on the essential dimension of reducti…

The problem of low-tubal-rank tensor estimation is a fundamental task with wide applications across high-dimensional signal processing, machine learning, and image science. Traditional approaches tackle such a problem by performing tensor…

Extending work of M. Zarzar, we evaluate the potential of Goppa-type evaluation codes constructed from linear systems on projective algebraic surfaces with small Picard number. Putting this condition on the Picard number provides some…

Linckelmann showed in 2011 that a group algebra is separably equivalent to the group algebra of its Sylow p-subgroups. In this article we use this relationship, together with Mackey decomposition, to demonstrate that a group algebra of a…

Answering a question of T. Cochrane and C. Pinner, we prove that for any {\epsilon}>0, sufficiently large prime number p and an arbitrary multiplicative subgroup R of the field Z/pZ, p^{\epsilon} < |R| < p^{2/3-{\epsilon}} the following…

We give a construction of a wide class of modular symbols attached to reductive groups. As an application we construct a p-adic distribution interpolating the special values of the twisted Rankin-Selberg L-function attached to cuspidal…

We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear…

Let $G$ be a connected reductive algebraic group with simply connected derived subgroup. Over the complex numbers there exists a local method to study the geometric properties of a point $g$ in the closure of a Jordan class of $G$ in terms…

Agrawal and Vinay [AV08] showed how any polynomial size arithmetic circuit can be thought of as a depth four arithmetic circuit of subexponential size. The resulting circuit size in this simulation was more carefully analyzed by Korian…

We give upper bounds for the number of irreducible representations of dimension at most n for a compact semisimple Lie group. In particular, we prove that there are at most n irreducible representations of dimension at most n for a simple…

We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enables us to prove an amortized randomized Omega(lg n) lower bound per operation for several data structural problems on n elements,…

Given a reduced abelian $p$-group, we give an upper bound on the Scott complexity of the group in terms of its Ulm invariants. For limit ordinals, we show that this upper bound is tight. This gives an explicit sequence of such groups with…

We prove that the minimal representation dimension of a direct product $G$ of non-abelian groups $G_1,\ldots,G_n$ is bounded below by $n+1$ and thereby answer a question of Ab\'ert. If each $G_i$ is moreover non-solvable, then this lower…

In this paper we obtain a new lower bound on the Erd\H{o}s distinct distances problem in the plane over prime fields. More precisely, we show that for any set $A\subset \mathbb{F}_p^2$ with $|A|\le p^{7/6}$, the number of distinct distances…

The Erd\H{o}s-Ginzburg-Ziv constant of an abelian group $G$, denoted $\mathfrak{s}(G)$, is the smallest $k\in\mathbb{N}$ such that any sequence of elements of $G$ of length $k$ contains a zero-sum subsequence of length $\exp(G)$. In this…

Let $G$ be a reductive group over a field $k$ which is algebraically closed of characteristic $p \neq 0$. We prove a structure theorem for a class of subgroup schemes of $G$, for $p$ bounded below by the Coxeter number of $G$. As…

The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…

We prove, for a sufficiently small subset $\mathcal{A}$ of a prime residue field, an estimate on the number of solutions to the equation $(a_1-a_2)(a_3-a_4) = (a_5-a_6)(a_7-a_8)$ with all variables in $\mathcal{A}$. We then derive new…

Reductions---rules that reduce input size while maintaining the ability to compute an optimal solution---are critical for developing efficient maximum independent set algorithms in both theory and practice. While several simple reductions…

In this paper we prove equivalences of categories relating the derived category of a block of the category of representations of a connected reductive algebraic group over an algebraically closed field of characteristic $p$ bigger than the…

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…