English
Related papers

Related papers: Enumeration of almost polynomial rational function…

200 papers

The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…

Computational Complexity · Computer Science 2018-12-18 Peter Bürgisser

The minimal ramification problem may be considered as a quantitative version of the inverse Galois problem. For a nontrivial finite group $G$, let $m(G)$ be the minimal integer $m$ for which there exists a Galois extension $N/\mathbb{Q}$…

Number Theory · Mathematics 2020-05-06 Lior Bary-Soroker , Tomer M. Schlank

A bracket is a function that assigns a number to each monomial in variables \tau_0, \tau_1, ... We show that any bracket satisfying the string and the dilaton relations gives rise to a power series lying in the algebra A generated by the…

Algebraic Geometry · Mathematics 2007-05-23 Dimitri Zvonkine

We consider harmonic polynomials of real variables $x,y,z$ that are eigenfunctions of the rotations about the axis $z$. They have the form $(x\pm yi)^{n}p(x,y,z)$, where $p$ is a rotation invariant polynomial. Let ${\mathfrak R}_{m}$ be the…

Classical Analysis and ODEs · Mathematics 2019-10-29 Victor Gichev

We describe a wide class of polynomials, which is a natural generalization of Hurwitz stable polynomials. We also give a detailed account of so-called self-interlacing polynomials, which are dual to Hurwitz stable polynomials but have only…

Classical Analysis and ODEs · Mathematics 2010-05-19 Mikhail Tyaglov

In this paper we will give a scheme-theoretic discussion on the unramified extensions of an arithmetic function field in several variables. The notion of unramified discussed here is parallel to that in algebraic number theory and for the…

Number Theory · Mathematics 2010-06-29 Feng-Wen An

In approximation theory, logarithmic derivatives of complex polynomials are called simple partial fractions (SPF) as suggested by Eu.P. Dolzhenko. Many solved and unsolved extremal problems related to SPF are traced back to works of G.…

Classical Analysis and ODEs · Mathematics 2017-10-17 V. I. Danchenko , M. A. Komarov , P. V. Chunaev

We consider the class of compact Riemann surfaces which are ramified coverings of the Riemann sphere $\hat{\mathbb{C}}$. Based on a triangulation of this covering of the sphere $\mathbb{S}^2\cong \hat{\mathbb{C}}$ and its stereographic…

Complex Variables · Mathematics 2018-09-14 Alexander I. Bobenko , Ulrike Bücking

Generalizing Emerton's completed cohomologies, we define relative completed cohomologies of arithmetic manifolds. We also define modular symbols for them, and show that the relative completed cohomology spaces interpolate the ``nearly…

Number Theory · Mathematics 2025-03-05 Dongwen Liu , Binyong Sun

The notion of a tamely ramified covering is canonical only for curves. Several notions of tameness for coverings of higher dimensional schemes have been used in the literature. We show that all these definitions are essentially equivalent.…

Algebraic Geometry · Mathematics 2009-08-11 Moritz Kerz , Alexander Schmidt

Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…

Computational Complexity · Computer Science 2025-07-16 Oliver Broadrick , Sanyam Agarwal , Guy Van den Broeck , Markus Bläser

A finite morphism $f:X\to \mathbb P^2$ of a a smooth irreducible projective surface $X$ is called an almost generic cover if for each point $p\in \mathbb P^2$ the fibre $f^{-1}(p)$ is supported at least on $deg(f)-2$ distinct points and $f$…

Algebraic Geometry · Mathematics 2018-12-05 Vik. S. Kulikov

We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…

Functional Analysis · Mathematics 2022-06-09 Olavi Nevanlinna

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

Computational Complexity · Computer Science 2025-07-01 Somnath Bhattacharjee , Mrinal Kumar , Shanthanu S. Rai , Varun Ramanathan , Ramprasad Saptharishi , Shubhangi Saraf

We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…

Rings and Algebras · Mathematics 2024-02-07 A. Amparan , I. Baragaña , S. Marcaida , A. Roca

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

Combinatorics · Mathematics 2007-05-23 Ki Hang Kim , Fred W. Roush

We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…

Commutative Algebra · Mathematics 2016-10-14 John Abbott , Anna Maria Bigatti , Lorenzo Robbiano

We introduce stable tropical curves and use these to count covers of the $p$-adic projective line of fixed degree and ramification types by Mumford curves in terms of tropical Hurwitz numbers. Our counts depend on the branch loci of the…

Algebraic Geometry · Mathematics 2008-06-05 Patrick Erik Bradley

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Buse , Marc Chardin

We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…

Combinatorics · Mathematics 2025-07-02 Xavier Coulter , Norman Do , Ellena Moskovsky