Related papers: Root Extraction in Certain Finite Abelian $p$-Grou…
We state and study the congruence subgroup problem for groups acting on rooted tree, and for branch groups in particular. The problem is reduced to the computation of the congruence kernel, which we split into two parts: the branch kernel…
We consider a class of linear programs on graphs with total variation regularization and a budgetary constraint. For these programs, we give a characterization of basic solutions in terms of rooted spanning forests with orientation on the…
Given a set R of robots, each one located at different vertices of an infinite regular tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a multiset F of grid vertices such that |R|=|F|, APF asks for…
We study the properties of the fundamental group of an affine curve over an algebraically closed field of characteristic $p$, from the point of view of embedding problems. In characteristic zero, the fundamental group is free, but in…
The \emph{generalized sorting problem} is a restricted version of standard comparison sorting where we wish to sort $n$ elements but only a subset of pairs are allowed to be compared. Formally, there is some known graph $G = (V, E)$ on the…
We prove \emph{uniform solvability estimates} for certain families of elliptic problems posed in a bounded family of domains (for example, a sequence that converges to another domain). We provide uniform estimates both in weighted and in…
We study the infinitesimal generator of the Poisson semigroup in $L^p$ associated with homogeneous, second-order, strongly elliptic systems with constant complex coefficients in the upper-half space, which is proved to be the…
We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.
It is well-known that abelian varieties are projective, and so that there exist explicit polynomial and rational functions which define both the variety and its group law. It is however difficult to find any explicit polynomial and rational…
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…
In this paper a new method which is a generalization of the Ehrlich-Kjurkchiev method is developed. The method allows to find simultaneously all roots of the algebraic equation in the case when the roots are supposed to be multiple with…
We give an explicit description of the behaviour of the root number in the family given by twists of an elliptic curve $E$ by the rational values of a polynomial $f(T)$. In particular, we give a criterion (on $f$ depending on $E$) for the…
Let $E$ be an elliptic curve, defined over a quartic extension $K$ of $\mathbb{Q}$, with $j(E) \in \mathbb{Q}$. In this paper, we classify the possible torsion subgroup structures $E(K)_{\text{tors}}$.
In the context of finite Abelian groups two problems are presented and solved using quantum computing techniques. The first is the well--known Hidden Subgroup Problem, originally solved by Simon in a landmark work. The second is the Fully…
The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…
The main aim of this article is to compute all the moments of the number of $p^\ell$-torsion elements in some type of nite abelian groups. The averages involved in these moments are those de ned for the Cohen-Lenstra heuristics for class…
We initiate the study of the \emph{twisted conjugacy growth series} of a finitely generated group, the formal power series associated to the twisted conjugacy growth function. Our main result is that, for a virtually abelian group, this…
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
Given a field with a set of discrete valuations $V$, we show how the genus of a division algebra over the field is related to the genus of the residue algebras at various valuations in $V$ and the ramification data. When the division…