Related papers: Lower bounds on the essential dimension of reducti…
We study irreducible restrictions from modules over alternating groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. This is known when the…
The classification of the finite subgroups of $\mathrm{GL}_n(\mathbb{C})$ and $\mathrm{PGL}_n(\mathbb{C})$ is a classical problem in the field of finite group theory, dating back to the late 19th century with authors like Klein, Jordan,…
We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…
Let $E$ be an elliptic curve over $\mathbb{Q}$ which has multiplicative reduction at a fixed prime $p$. For each positive integer $n$ we put $K_n:=\mathbb{Q}(E[p^n])$. The aim of this paper is to extend the author's previous our results…
We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.
We prove a decomposition of definable groups in o-minimal structures generalizing the Jordan-Chevalley decomposition of linear algebraic groups. It follows that any definable linear group G is a semidirect product of its maximal normal…
The aim of this paper is to give an exposition of recent progress on the determination of the unitarizable Langlands quotients of minimal principal series for reductive groups over the real or p-adic fields in characteristic 0.
We study fundamental block-structured integer programs called tree-fold and multi-stage IPs. Tree-fold IPs admit a constraint matrix with independent blocks linked together by few constraints in a recursive pattern; and transposing their…
We prove the first known nontrivial bounds on the sizes of the 2-torsion subgroups of the class groups of cubic and higher degree number fields $K$ (the trivial bound being $O_{\epsilon}(|{\rm Disc}(K)|^{1/2+\epsilon})$ by Brauer--Siegel).…
In 1980 Rostislav Grigorchuk constructed a group $G$ of intermediate growth, and later obtained the following estimates on its growth $\gamma$: $e^{\sqrt{n}}\precsim\gamma(n)\precsim e^{n^\beta},$ where $\beta=\log_{32}(31)\approx0.991$. He…
In this article we provide simple and provable bounds on the size and shape of the locus of discrete subgroups of $\mathsf{PSL}(2,\mathbb{C})\cong \operatorname{Isom}^+(\mathbb{H}^3)$ which split as a free product of cyclic groups…
In this paper, we study the reducibility of degenerate principal series of the simple, simply-connected exceptional group of type $E_6$. Furthermore, we calculate the maximal semi-simple subrepresentation and quotient of these…
The most degenerate unitary principal series representations {\pi}_{i{\lambda},{\delta}} (with {\lambda} \in R, \delta \in Z/2Z) of G = GL(N,R) attain the minimum of the Gelfand-Kirillov dimension among all irreducible unitary…
A linear algebraic group G defined over a field k is called special if every G-torsor over every field extension of k is trivial. In 1958 Grothendieck classified special groups in the case where the base field is algebraically closed. In…
In this article, we study the minimal degree [K(T):K] of a p-subgroup T <= E(\overline{K})_tors for an elliptic curve E/K defined over a number field K. Our results depend on the shape of the image of the p-adic Galois representation…
The essential dimension is a numerical invariant of an algebraic group G which may be thought of as a measure of complexity of G-torsors over fields. A recent theorem of N. Karpenko and A. Merkurjev gives a simple formula for the essential…
Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…
We prove a lower bound on the dimension of the set of maximal border subrank tensors. This is the first such bound of its type.
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness. This includes lower bounds for: * high-dimensional…
We study reductive subgroups $H$ of a reductive linear algebraic group $G$ -- possibly non-connected -- such that $H$ contains a regular unipotent element of $G$. We show that under suitable hypotheses, such subgroups are $G$-irreducible in…