相关论文: Degree bound for toric envelope of a linear algebr…

In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…

We use geometric and cohomological methods to show that given a degree bound for membership in ideals of a fixed degree type in the polynomial ring P=k[x_0,..., x_d], one obtains a good generic degree bound for membership in the tight…

We establish doubly-exponential degree bounds for Gr\"obner bases in certain algebras of solvable type over a field (as introduced by Kandri-Rody and Weispfenning). The class of algebras considered here includes commutative polynomial…

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Let $G$ be a semisimple linear algebraic group over a field $k$ and let $G^+(k)$ be the subgroup generated by the subgroups $R_u(Q)(k)$, where $Q$ ranges over all the minimal $k$-parabolic subgroups $Q$ of $G$. We prove that if $G^+(k)$ is…

Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…

We derive asymptotically optimal upper bounds on the number of L-rational torsion points on a given elliptic curve or Drinfeld module defined over a finitely generated field K, as a function of the degree [L:K]. Our main tool is the adelic…

A countable group G is called k-linear sofic (for some 0 <k \le 1) if finite subsets of G admit "approximate representations" by complex invertible matrices in the normalized rank metric, so that non-identity elements are k-away from the…

We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…

We introduce a family of toric algebras defined by maximal chains of a finite distributive lattice. Applying results on stable set polytopes we conclude that every such algebra is normal and Cohen-Macaulay, and give an interpretation of its…

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…

In 1878, Jordan showed that a finite subgroup of GL(n,C) contains an abelian normal subgroup whose index is bounded by a function of n alone. Previously, the author has given precise bounds. Here, we consider analogues for finite linear…

Let $\mathcal{F}_n(X;G)$ denote the set of number fields of degree $n$ with absolute discriminant no larger than $X$ and Galois group $G$. This set is known to be finite for any finite permutation group $G$ and $X \geq 1$. In this paper, we…

An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same…

We give geometric and algorithmic criterions in order to have of a proper Galois closure for a codimension one germ of quasi-homogeneous foliation. We recall this notion recently introduced by B. Malgrange, and describe the Galois envelope…

Let $k$ be an algebraically closed field of characteristic zero, $F$ be an algebraically closed extension of $k$ of transcendence degree one, and $G$ be the group of automorphisms over $k$ of the field $F$. The purpose of this note is to…

We consider a problem introduced by Feige, Gamarnik, Neeman, R\'acz and Tetali [2020], that of finding a large clique in a random graph $G\sim G(n,\frac{1}{2})$, where the graph $G$ is accessible by queries to entries of its adjacency…

We give a method to describe all congruence images of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n, \mathbb{Z})$. The method is applied to obtain efficient algorithms for solving this problem in odd prime degree $n$; if…

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…