English
Related papers

Related papers: Relationship between Vieta-Lucas polynomials and L…

200 papers

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

Commutative Algebra · Mathematics 2012-10-25 William Messing , Victor Reiner

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…

Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…

Combinatorics · Mathematics 2018-05-24 Dazhao Tang

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2015-06-30 Tewodros Amdeberhan , Roberto Tauraso

The simplest non-trivial solutions of WDVV equations are A_n and B_n-potentials, which describe metrics of K.Saito on spaces of versal deformation of A_n and B_n-singularities. These are some polynomials, which were known for $n\leqslant$…

High Energy Physics - Theory · Physics 2015-06-26 S. M. Natanzon

We consider a class of strongly q-log-convex polynomials based on a triangular recurrence relation with linear coefficients, and we show that the Bell polynomials, the Bessel polynomials, the Ramanujan polynomials and the Dowling…

Combinatorics · Mathematics 2019-08-15 William Y. C. Chen , Larry X. W. Wang , Arthur L. B. Yang

In this paper we show that the leading coefficient $\mu(y,w)$ of some Kazhdan-Lusztig polynomials $P_{y,w}$ with $y,w$ in an affine Weyl group of type $\tilde A_n $ is $n+2$. This fact has some consequences on the dimension of first…

Representation Theory · Mathematics 2015-05-14 Leonard Scott , Nanhua Xi

We show that the A-polynomial $A_n$ of the 1-parameter family of pretzel knots $K_n=(-2,3,3+2n)$ satisfies a linear recursion relation of order 4 with explicit constant coefficients and initial conditions. Our proof combines results of…

Geometric Topology · Mathematics 2011-04-11 Stavros Garoufalidis , Thomas W. Mattman

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

Combinatorics · Mathematics 2024-03-07 Paweł Hitczenko

An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n \geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n\geq 1}$ is uniformly distributed modulo one for…

Number Theory · Mathematics 2016-03-17 Christoph Aistleitner , Gerhard Larcher

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

Symbolic Computation · Computer Science 2007-05-23 Martin Ziegler

Let p(x) be a polynomial of degree 4 with four distinct real roots r1<r2<r3<r4. Let x1<x2<x3 be the critical points of p, and define the ratios s_{k}=((x_{k}-r_{k})/(r_{k+1}-r_{k})),k=1,2,3. For notational convenience, let s1=u, s2=v, and…

Classical Analysis and ODEs · Mathematics 2013-08-16 Alan Horwitz

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2017-04-21 Zhi-Wei Sun

The polynomials $d_n(x)$ are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime $p$, the following congruences hold modulo $p$: \begin{align*}…

Number Theory · Mathematics 2016-04-19 Song Guo , Victor J. W. Guo

In this paper we study effective recursion formulae for computing intersection numbers of mixed $\psi$ and $\kappa$ classes on moduli spaces of curves. By using the celebrated Witten-Kontsevich theorem, we generalize Mulase-Safnuk form of…

Algebraic Geometry · Mathematics 2013-03-28 Kefeng Liu , Hao Xu

In this paper, we present some criteria for the $2$-$q$-log-convexity and $3$-$q$-log-convexity of combinatorial sequences, which can be regarded as the first column of certain infinite triangular array $[A_{n,k}(q)]_{n,k\geq0}$ of…

Combinatorics · Mathematics 2018-07-04 Bao-Xuan Zhu

For every $a\geq1$ we give a recursion algorithm of building of set of solutions of equations of the form $t(x+a)=t(x)$ and $t(x+a)=1-t(x),$ where $\{t(n)\}$ is Thue-Morse sequence. We pose an open problem and two conjectures.

Number Theory · Mathematics 2012-10-09 Vladimir Shevelev

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

Dynamical Systems · Mathematics 2012-08-29 James T. Campbell , Jared T. Collins

Let $(X,\mu,T_1,...,T_l)$ be a measure-preserving system with those $T_i$ are commuting. Suppose that the polynomials $p_1(t),...,p_{l}(t)\in\Z[t]$ with $p_j(0)=0$ have distinct degrees. Then for any $\epsilon>0$ and $A\subseteq X$ with…

Combinatorics · Mathematics 2015-02-27 Hao Pan

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

Combinatorics · Mathematics 2015-09-10 Alejandro Erickson , Abraham Isgur , Bradley W. Jackson , Frank Ruskey , Stephen M. Tanny