English
Related papers

Related papers: Multiplier sequences and logarithmic mesh

200 papers

Continued fractions whose elements are polynomial sequences have been carefully studied mostly in the cases where the degree of the numerator polynomial is less than or equal to two and the degree of the denominator polynomial is less than…

Number Theory · Mathematics 2018-12-26 Doug Bowman , James Mc Laughlin

We show that linear differential operators with polynomial coefficients over a field of characteristic zero can be multiplied in quasi-optimal time. This answers an open question raised by van der Hoeven.

Computational Complexity · Computer Science 2016-11-15 Alexandre Benoit , Alin Bostan , Joris van der Hoeven

In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…

Number Theory · Mathematics 2015-06-09 Michiel Kosters , Sze Ling Yeo

We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…

Optimization and Control · Mathematics 2014-05-08 Jon Lee , Shmuel Onn , Lyubov Romanchuk , Robert Weismantel

We present an algorithm which, given a linear recurrence operator $L$ with polynomial coefficients, $m \in \mathbb{N}\setminus\{0\}$, $a_1,a_2,\ldots,a_m \in \mathbb{N}\setminus\{0\}$ and $b_1,b_2,\ldots,b_m \in \mathbb{K}$, returns a…

Symbolic Computation · Computer Science 2018-04-10 Marko Petkovšek

Given a polynomial or a rational map f we associate to it a space of maps. We introduce local coordinates in this space, which are essentially the set of critical values of the map. Then we consider an arbitrary periodic orbit of f with…

Dynamical Systems · Mathematics 2010-04-14 Genadi Levin

The core of a finite-dimensional modular representation $M$ of a finite group $G$ is its largest non-projective summand. We prove that the dimensions of the cores of $M^{\otimes n}$ have algebraic Hilbert series when $M$ is Omega-algebraic,…

Representation Theory · Mathematics 2021-05-12 Alexandru Chirvasitu , Tara Hudson , Aparna Upadhyay

We consider positive, integral-preserving linear operators acting on $L^1$ space, known as stochastic operators or Markov operators. We show that, on finite-dimensional spaces, any stochastic operator can be approximated by a sequence of…

Functional Analysis · Mathematics 2019-06-13 Shirin Moein , Rajesh Pereira , Sarah Plosker

We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a…

Classical Analysis and ODEs · Mathematics 2017-06-26 Suvrit Sra

We prove that every real algebraic action on a smooth real algebraic variety has a prolongation with a "moving frame".

Dynamical Systems · Mathematics 2015-09-08 Scot Adams

In this paper, extending our earlier program, we derive maximal canonical extensions for multiplicative summations into algebraically closed fields. We show that there is a well-defined analogue to minimal polynomials for a series algebraic…

Commutative Algebra · Mathematics 2021-11-22 Robert J. MacG. Dawson , Grant Molnar

After fixing a triangulation $L$ of a $k$-dimensional simplex that has no new vertices on the boundary, we introduce a triangulation operation on all simplicial complexes that replaces every $k$-face with a copy of $L$, via a sequence of…

Combinatorics · Mathematics 2015-10-21 Gábor Hetyei , Eran Nevo

We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.

Classical Analysis and ODEs · Mathematics 2015-11-11 Vadim B. Kuznetsov , Evgeny K. Sklyanin

The strong spectral order induces a natural partial ordering on the manifold $H_{n}$ of monic hyperbolic polynomials of degree $n$. We prove that twisted root maps associated with linear operators acting on $H_{n}$ are G\aa rding convex on…

Classical Analysis and ODEs · Mathematics 2008-07-28 Julius Borcea

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

Number Theory · Mathematics 2021-04-08 Jozsef Solymosi , Ethan P. White , Chi Hoi Yip

We study the asymptotic distribution of roots of Lommel polynomials as polynomials of the order with a variable and purely imaginary argument. The roots are complex and accumulate on certain curves in the complex plane. We prove existence…

Classical Analysis and ODEs · Mathematics 2021-02-02 Petr Blaschke , František Štampach

Given a Banach space $X$ and $d\in \mathbb{N}$, we construct a metric space $\mathbb{V}_X^d$ with the property that every $d$-homogeneous polynomial defined on $X$ factors through a Lipschitz map on it. We prove that the metric on…

Functional Analysis · Mathematics 2024-12-17 Maite Fernández-Unzueta

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

Number Theory · Mathematics 2022-10-31 Geoffrey Price , Katherine Thompson

Let $\mathcal{A}$ be a real line arrangement and $\mathcal{D}(\mathcal{A})$ the module of $\mathcal{A}$--derivations. First, we give a dynamical interpretation of $\mathcal{D}(\mathcal{A})$ as the set of polynomial vector fields which…

Dynamical Systems · Mathematics 2015-01-07 Benoît Guerville-Ballé , Juan Viu-Sos

Recent breakthrough methods \cite{gggz,joux,bgjt} on computing discrete logarithms in small characteristic finite fields share an interesting feature in common with the earlier medium prime function field sieve method \cite{jl}. To solve…

Computational Complexity · Computer Science 2014-02-27 Ming-Deh Huang , Anand Kumar Narayanan