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

Let $G$ and $\tilde G$ be connected complex reductive Lie groups, $G$ semisimple. Let $\Lambda^+$ be the monoid of dominant weights for a positive root system $\Delta^+$, and let $l(w)$ be the length of a Weyl group element $w$. Let…

In this article, we give a theorem of reduction of the structure group of a principal bundle P with regular structure group G. Then, when G is in the classes of Lie groups defined by T.Robart [13], we define the closed holonomy group of a…

Suppose G is a real reductive Lie group in Harish-Chandra's class. We propose here a structure for the set \Pi_u(G) of equivalence classes of irreducible unitary representations of G. (The subscript u will be used throughout to indicate…

We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…

Suppose $G$ is a simple algebraic group defined over an algebraically closed field of good characteristic $p$. In 2018 Korhonen showed that if $H$ is a connected reductive subgroup of $G$ which contains a distinguished unipotent element $u$…

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

We prove the existence of certain rationally rigid triples E8 in good characteristic and thereby show that these groups over the prime field occur as Galois groups over the field of rational numbers. We show that these triples give rise to…

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…

We study the growth of the local $L^2$-norms of the unitary Eisenstein series for reductive groups over number fields, in terms of their parameters. We derive a \emph{poly-logarithmic} bound on an average, for a large class of reductive…

We consider the problem of recovering polynomials that are sparse with respect to the basis of Legendre polynomials from a small number of random samples. In particular, we show that a Legendre s-sparse polynomial of maximal degree N can be…

We introduce a Lie algebra of initial terms of logarithmic vector fields along a hypersurface singularity. Extending the formal structure theorem in [GS06, Thm. 5.4], we show that the completely reducible part of its linear projection lifts…

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

In this thesis we develop a novel framework to study smooth and strongly convex optimization algorithms, both deterministic and stochastic. Focusing on quadratic functions we are able to examine optimization algorithms as a recursive…

We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…

Let G be a connected simple adjoint p-adic group not isomorphic to a projective linear group PGL(m,D) of a division algebra D, or an adjoint ramified unitary group of a split hermitian form in 3 variables. We prove that G admits an…

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…

We prove quantitative versions of Borel and Harish-Chandra's theorems on reduction theory for arithmetic groups. Firstly, we obtain polynomial bounds on the lengths of reduced integral vectors in any rational representation of a reductive…

We exploit various inclusions of algebraic groups to give a new construction of groups of type E8, determine the Killing forms of the resulting E8's, and define an invariant of central simple algebras of degree 16 with orthogonal involution…

We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce…