English
Related papers

Related papers: Algebraic integrability with bounded genus

200 papers

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Rings and Algebras · Mathematics 2023-07-14 Libor Barto , Antoine Mottet

We study the problems of testing isomorphism of polynomials, algebras, and multilinear forms. Our first main results are average-case algorithms for these problems. For example, we develop an algorithm that takes two cubic forms $f, g\in…

Data Structures and Algorithms · Computer Science 2023-06-22 Joshua A. Grochow , Youming Qiao , Gang Tang

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

Algebraic Geometry · Mathematics 2019-11-06 Adrien Poteaux , Martin Weimann

We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class C, and using a first-order formula {\phi}…

Logic in Computer Science · Computer Science 2023-03-03 Pierre Ohlmann , Michał Pilipczul , Szymon Toruńczyk , Wojciech Przybyszewski

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…

Commutative Algebra · Mathematics 2009-02-25 Oleg Golubitsky , Marina Kondratieva , Marc Moreno Maza , Alexey Ovchinnikov

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

Number Theory · Mathematics 2017-01-30 D. R. Heath-Brown , Giacomo Micheli

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

Combinatorics · Mathematics 2019-12-10 Bo Lin , Ngoc Mai Tran

We say that the the germ of a singular holomorphic foliation on $(\mathbb{C}^2,0)$ is algebraizable whenever it is holomorphically conjugate to the singularity of a foliation defined globally on a projective algebraic surface. The object of…

Complex Variables · Mathematics 2017-02-13 Valente Ramirez

Given a field $F$, an integer $n\geq 1$, and a matrix $A\in M_n(F)$, are there polynomials $f,g\in F[X]$, with $f$ monic of degree $n$, such that $A$ is similar to $g(C_f)$, where $C_f$ is the companion matrix of $f$? For infinite fields…

Rings and Algebras · Mathematics 2013-04-08 Natalio H. Guersenzvaig , Fernando Szechtman

It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…

Rings and Algebras · Mathematics 2017-12-06 Albert Heinle , Viktor Levandovskyy

Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…

Algebraic Geometry · Mathematics 2021-09-09 Rodolfo Aguilar Aguilar

In this work we shall present a survey on problems and results on singular holomorphic foliations and Pfaff systems on complex manifolds assuming that these objects possess invariant analytic varieties. We will focus on recent results which…

Algebraic Geometry · Mathematics 2021-08-13 Maurício Corrêa

We consider a class of foliations on the complex projective plane that are determined by a quadratic vector field in a fixed affine neighborhood. Such foliations, as a rule, have an invariant line at infinity. Two foliations with…

Dynamical Systems · Mathematics 2010-10-28 Yulij Ilyashenko , Vadims Moldavskis

An algebra is called a GI-algebra if its group of units satisfies a group identity. We provide positive support for the following two open problems. 1. Does every algebraic GI-algebra satisfy a polynomial identity? 2. Is every algebraically…

Rings and Algebras · Mathematics 2008-04-12 Eric Jespers , David Riley , Salvatore Siciliano

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Number Theory · Mathematics 2022-10-11 Jean Kieffer

This paper contributes to the solution of the Poincare problem, which is to bound the degree of a (generalized algebraic) leaf of a (singular algebraic) foliation of the complex projective plane. The first theorem gives a new sort of bound,…

Algebraic Geometry · Mathematics 2007-05-23 E. Esteves , S. Kleiman

We prove that if a polynomial vector field on C2 has a proper and non-algebraic trajectory analytically isomorphic to C* all its trajectories are proper, and except at most one which is contained in an algebraic curve of type C all of them…

Complex Variables · Mathematics 2010-10-29 Alvaro Bustinduy

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

Logic · Mathematics 2021-09-30 Jakub Gismatullin , Katarzyna Tarasek

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

Dynamical Systems · Mathematics 2007-05-23 Laura DeMarco

Phylogenetic trees canonically arise as embeddings of phylogenetic networks. We recently showed that the problem of deciding if two phylogenetic networks embed the same sets of phylogenetic trees is computationally hard, \blue{in…

Combinatorics · Mathematics 2021-04-13 Janosch Doecker , Simone Linz , Charles Semple
‹ Prev 1 4 5 6 7 8 10 Next ›