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

Upper and lower bounds are given for the maximum Euclidean curvature among faces in Bianchi's fundamental polyhedron for $PSL_2(O)$ in the upper-half space model of hyperbolic space, where $O$ is an imaginary quadratic ring of integers with…

Minimal representations of a real reductive group G are the `smallest' irreducible unitary representations of G. We discuss special functions that arise in the analysis of L^2-model of minimal representations.

In this paper, we construct a family of reductive groups, including all reductive groups up to a given rank. We also construct a similar versal family of quasi-split reductive groups. This result generalizes a former result of N.Avni and…

In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the…

Given a field $F$, an \'etale extension $L/F$ and an Azumaya algebra $A/L$, one knows that there are extensions $E/F$ such that $A \otimes_F E$ is a split algebra over $L \otimes_F E$. In this paper we bound the degree of a minimal…

L. Szpiro and T. Tucker recently proved that under mild conditions, the valuation of the minimal discriminant of an elliptic curve with semistable reduction over a discrete valuation ring can be expressed in terms of intersections between…

Important subalgebras of a Lie algebra of an algebraic group are its toral subalgebras, or equivalently (over fields of characteristic 0) its Cartan subalgebras. Of great importance among these are ones that are split: their action on the…

We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…

Let k be a field of characteristic 0. Let G be a reductive group over the ring of Laurent polynomials R=k[x_1^{\pm 1},...,x_n^{\pm 1}]. We prove that G has isotropic rank >=1 over R iff it has isotropic rank >=1 over the field of fractions…

In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…

For a prime number $\ell$ and an extension of number fields $K/F$, we prove new lower bounds on the $\ell$-rank of the ideal class group of $K$ based on prime ramification in $K/F$. Unlike related results from the literature, our bound is…

Let G be a connected reductive linear algebraic group. We use geometric methods to investigate G-completely reducible subgroups of G, giving new criteria for G-complete reducibility. We show that a subgroup of G is G-completely reducible if…

The purpose of this paper is to propose a version of the notion of convenient Lie groupoid as a generalization of this concept in finite dimension. The authors point out which obstructions appear in the infinite dimensional context and how…

Let $\mathcal{F}_n(X;G)$ denote the set of number fields of degree $n$ with absolute discriminant no larger than $X$ and Galois group $G$. This set is known to be finite for any finite permutation group $G$ and $X \geq 1$. In this paper, we…

We study the problem of finding the best linear model that can minimize least-squares loss given a data-set. While this problem is trivial in the low dimensional regime, it becomes more interesting in high dimensions where the population…

We study Patterson-Sullivan measures for a class of discrete subgroups of higher rank semisimple Lie groups, called transverse groups, whose limit set is well-defined and transverse in a partial flag variety. This class of groups includes…

A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…

We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In…

In this article we show the rough outline of a computer algorithm to generate lower bounds on the exponential function of (in principle) arbitrary precision. We implemented this to generate all necessary analytic terms for the Boltzmann…

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…