English
Related papers

Related papers: Lacunary Polynomial Compositions

200 papers

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

Number Theory · Mathematics 2015-10-30 Jakob Ablinger

This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.

Classical Analysis and ODEs · Mathematics 2021-11-12 Tom H. Koornwinder

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…

Number Theory · Mathematics 2013-04-23 Darren Glass

In this paper we focus on two new families of polynomials which are connected with exponential polynomials and geometric polynomials. We discuss their generalizations and show that these new families of polynomials and their generalizations…

Number Theory · Mathematics 2010-02-03 Ayhan Dil , Veli Kurt

In this paper, we consider several special polynomials related to associated sequences of polynomials. Finally, we give some new and interesting identities of those polynomials arising from transfer formula for the associated sequences.

Number Theory · Mathematics 2013-02-01 Taekyun Kim , Dae San Kim

In this survey article, we review some results and conjectures related to orthogonal polynomials on Cantor sets. The main purpose of this paper is to emphasize the role of equilibrium measures in order to have a general theory of…

Classical Analysis and ODEs · Mathematics 2016-11-08 Gökalp Alpan

By a classical principle of analysis, sufficiently thin subsequences of general sequences of functions behave like sequences of independent random variables. This observation not only explains the remarkable properties of lacunary…

Number Theory · Mathematics 2014-01-13 Christoph Aistleitner , Istvan Berkes , Robert Tichy

The aim of this paper is a quantitative analysis of the solution set of a system of polynomial nonlinear differential equations, both in the ordinary and partial case. Therefore, we introduce the differential counting polynomial, a common…

Analysis of PDEs · Mathematics 2015-04-07 Markus Lange-Hegermann

Given a ternary homogeneous polynomial, the fixed points of the map from $\mathbb{P}^2$ to itself defined by its gradient are called its eigenpoints. We focus on cubic polynomials, and analyze configurations of eigenpoints that admit one or…

Algebraic Geometry · Mathematics 2024-07-24 Valentina Beorchia , Matteo Gallet , Alessandro Logar

This article establishes the existence of Lyapunov functions for analyzing the stability of a class of state-constrained systems, and it describes algorithms for their numerical computation. The system model consists of a differential…

Optimization and Control · Mathematics 2021-04-14 Marianne Souaiby , Aneel Tanwani , Didier Henrion

We study the Dickson polynomials of the (k+1)-th kind over the field of complex numbers. We show that they are a family of co-recursive orthogonal polynomials with respect to a quasi-definite moment functional L_{k}. We find an integral…

Classical Analysis and ODEs · Mathematics 2020-11-24 Diego Dominici

We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…

Combinatorics · Mathematics 2007-05-23 J. -C. Novelli , J. -Y. Thibon

Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…

Statistical Mechanics · Physics 2016-08-31 N. Destainville , R. Mosseri , F. bailly

This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…

Combinatorics · Mathematics 2025-01-24 Sophie Marques , Elizabeth Mrema

This paper introduces a novel recurrent model for music composition that is tailored to the structure of polyphonic music. We propose an efficient new conditional probabilistic factorization of musical scores, viewing a score as a…

Sound · Computer Science 2019-11-28 John Thickstun , Zaid Harchaoui , Dean P. Foster , Sham M. Kakade

This paper proves that the characteristic polynomial is a complete unitary invariant for pairs of projection matrices. Some special cases involving three or more projections are also considered.

Representation Theory · Mathematics 2023-10-13 Kate Howell , Rongwei Yang

We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…

Classical Analysis and ODEs · Mathematics 2020-01-07 Teresa Augusta Mesquita

In this paper, I have proved that for a class of polynomial differential systems of degree n+1 ( where n is an arbitrary positive integer) the composition conjecture is true. I give the sufficient and necessary conditions for these…

Classical Analysis and ODEs · Mathematics 2019-05-01 Zhengxin Zhou

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Combinatorics · Mathematics 2015-02-10 Aleksi Saarela

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan