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

We prove a new upper bound on the essential p-dimension of the projective linear group PGLn.

We develop the representation theory for reductive linear differential algebraic groups (LDAGs). In particular, we exhibit an explicit sharp upper bound for orders of derivatives in differential representations of reductive LDAGs, extending…

Starting from basic identities of the group E8, we perform progressive reductions, namely decompositions with respect to the maximal and symmetric embeddings of E7xSU(2) and then of E6xU(1). This procedure provides a systematic approach to…

Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…

We define and study the essential dimension of an algebraic stack. We compute the essential dimension of the stacks Mgn and MgnBar of smooth, or stable, n-pointed curves of genus g. We also prove a general lower bound for the essential…

We prove the conjecture that higher Verlinde categories are geometrically reductive. This is one of the two properties required in order for recent results on algebraic geometry in tensor categories to apply to these categories. We also…

We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…

This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…

We prove that a matrix from the split orthogonal group over a polynomial ring with coefficients in a small-dimensional ring can be reduced to a smaller matrix by a bounded number of elementary orthogonal transformations. The bound is given…

We prove generic differentiability in $P$-minimal theories, strengthening an earlier result of Kuijpers and Leenknegt. Using this, we prove Onshuus and Pillay's $P$-minimal analogue of Pillay's conjectures on o-minimal groups. Specifically,…

Let $k$ be an algebraically closed field of characteristic $p>0$. Let $D$ be a $p$-divisible group over $k$. Let $n_D$ be the smallest non-negative integer for which the following statement holds: if $C$ is a $p$-divisible group over $k$ of…

We study the obstruction degrees of translates of sub-tori of multiplicative tori and we show how they are connected to lower bounds for the essential minimum of these varieties. In particular, we combine our computations with results of A.…

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

In the present paper, we provide a lower bound of the essential dimension over a field of positive characteristic via Kato's cohomology group, defined by cokernel of a general Artin-Schreier operator. Combining this with Tignol's result on…

We classify the irreducible representations of smooth, connected affine algebraic groups over a field, by tackling the case of pseudo-reductive groups. We reduce the problem of calculating the dimension for pseudo-split pseudo-reductive…

In this paper, we study the reducibility of degenerate principal series of the simple, simply-connected exceptional group of type $E_8$. Furthermore, we calculate the maximal semi-simple subrepresentation and quotient of these…

We prove that an element from the Chevalley group of type $E_6$ or $E_7$ over a polynomial ring with coefficients in a small-dimensional ring can be reduced to an element of certain proper subsystem subgroup by a bounded number of…

In this note, we propose a framework for proving computational lower bounds in norm approximation by leveraging a reverse detection--estimation gap. The starting point is a testing problem together with an estimator whose error is…

As part of the graph minor project, Robertson and Seymour showed in 1990 that the class of graphs that can be embedded in a given surface can be characterized by a finite set of minimal excluded minors. However, their proof, because…

We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.