Related papers: Large Galois groups with applications to Zariski d…

We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…

Let $n \geq 2$ and $p$ be a prime. Let $K$ be a number field and consider two Galois representations $\rho_1, \rho_2 : \operatorname{Gal}(\overline{K} / K) \to \operatorname{GL}_n(\mathbb{Z}_p)$ having residual image a $p$-group. We explain…

We study parameterized linear differential equations with coefficients depending meromorphically upon the parameters. As a main result, analogously to the unparameterized density theorem of Ramis, we show that the parameterized monodromy,…

Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\max\{|a_1|,\ldots,|a_n|\}\leq H$, how many have associated Galois group that is not the full symmetric group $S_n$? There are clearly $\gg H^{n-1}$ such…

Let $G$ be a finite group, $N$ a nilpotent normal subgroup of $G$ and let $\mathrm{V}(\mathbb{\Z} G, N)$ denote the group formed by the units of the integral group ring $\mathbb{\Z} G$ of $G$ which map to the identity under the natural…

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

In this work we present a new class of numerical semigroups called GSI-semigroups. We see the relations between them and others families of semigroups and we give explicitly their set of gaps. Moreover, an algorithm to obtain all the…

We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…

We classify all locally finite joinings of a horospherical subgroup action on \Gamma \ G when \Gamma is a Zariski dense geometrically finite subgroup of G=PSL_2(R) or PSL_2(C). This generalizes Ratner's 1983 joining theorem for the case…

For a list $\cal{L}$ of finite groups and for a profinite group $G$, we consider the intersection $T(G)$ of all open normal subgroups $N$ of $G$ with $G/N$ in $\cal{L}$. We give a cohomological characterization of the epimorphisms…

Let $d \ge 3$ be an integer and let $P \in \mathbb{Z}[x]$ be a polynomial of degree $d$ whose Galois group is $S_d$. Let $(a_n)$ be a linearly recuresive sequence of integers which has $P$ as its characteristic polynomial. We prove, under…

Let $K$ be a non-archimedean local field with residue field of characteristic $p$. We give necessary and sufficient conditions for a two-generator subgroup $G$ of ${\rm PSL_2}(K)$ to be discrete, where either $K=\mathbb{Q}_p$ or $G$…

We provide a new degree bound on the weighted sum-of-squares (SOS) polynomials for Putinar-Vasilescu's Positivstellensatz. This leads to another Positivstellensatz saying that if $f$ is a polynomial of degree at most $2 d_f$ nonnegative on…

We investigate the Galois cohomology of finitely generated maximal pro-$p$ quotients of absolute Galois groups. Assuming the well-known conjectural description of these groups, we show that Galois cohomology has the PBW property. Hence in…

For the p-adic group G=SL (2) , we present results of the computations of the sums of the Bernstein projectors of a given depth. Motivation for the computations is based on a conversation with Roger Howe in August 2013. The computations are…

We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function $f: \{0,1\}^n \to \{0,1\}$ is an $s$-sparse GF(2) polynomial versus $\eps$-far from every such polynomial. Our algorithm…

We explain in detail the definition, construction and generalisation of the Galois group of Chebyshev polynomials of high degree to the Galois group of chaotic chains. The calculations in this paper are performed for Chebyshev polynomials…

Given a global field K and a rational function phi defined over K, one may take pre-images of 0 under successive iterates of phi, and thus obtain an infinite rooted tree T by assigning edges according to the action of phi. The absolute…

We give a polynomial-time algorithm for detecting very long cycles in dense regular graphs. Specifically, we show that, given $\alpha \in (0,1)$, there exists a $c=c(\alpha)$ such that the following holds: there is a polynomial-time…

The seminal paper by Mazumdar and Saha \cite{MS17a} introduced an extensive line of work on clustering with noisy queries. Yet, despite significant progress on the problem, the proposed methods depend crucially on knowing the exact…