中文
相关论文

相关论文: Rank-two recurrence results for polynomials and qu…

200 篇论文

Fomin and Zelevinsky show that a certain two-parameter family of rational recurrence relations, here called the (b,c) family, possesses the Laurentness property: for all b,c, each term of the (b,c) sequence can be expressed as a Laurent…

组合数学 · 数学 2007-05-23 Gregg Musiker , James Propp

We study the set $\mathcal{L}_{F}$ of all $F$-vector spaces $L(P)$ where $P$ is monic and splits over $F$ and $L(Q)$ denotes the set of linear recurrence sequences over $F$ with characteristic polynomial $Q$. We show that $\mathcal{L}_{F}$…

环与代数 · 数学 2024-01-25 Mohammed Mouçouf

Let $K$ be an algebraically closed field of characteristic zero and let $f \in K[x]$. The $m$-th {\it cyclic resultant} of $f$ is \[r_m = \text{Res}(f,x^m-1).\] A generic monic polynomial is determined by its full sequence of cyclic…

代数几何 · 数学 2007-05-23 Christopher J. Hillar , Lionel Levine

Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…

Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every…

群论 · 数学 2026-04-03 Arunava Mandal , Shashank Vikram Singh

For every nonconstant monic polynomial $g \in \mathbb{Z}[X]$, let $\mathfrak{M}(g)$ be the set of positive integers $m$ for which there exist an integer linear recurrence $(s_n)_{n \geq 0}$ having characteristic polynomial $g$ and a…

数论 · 数学 2021-09-14 Carlo Sanna

A theory of Clebsch-Gordan coefficients for $SL(2, C)$ is given using only rational numbers. Features include orthogonality relations, recurrence relations, and Regge's symmetry group. Results follow from elementary representation theory…

表示论 · 数学 2021-10-28 Robert W. Donley , Won Geun Kim

For every monic polynomial $f \in \mathbb{Z}[X]$ with $\operatorname{deg}(f) \geq 1$, let $\mathcal{L}(f)$ be the set of all linear recurrences with values in $\mathbb{Z}$ and characteristic polynomial $f$, and let \begin{equation*}…

数论 · 数学 2024-01-17 Federico Accossato , Carlo Sanna

In this note, given a pair $(\mathfrak{g}, \lambda)$, where $\mathfrak{g}$ is a complex semisimple Lie algebra and $\lambda \in \mathfrak{h}^*$ is a dominant integral weight of $\mathfrak{g}$, where $\mathfrak{h} \subset \mathfrak{g}$ is…

表示论 · 数学 2019-04-16 Joseph Malkoun

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

数论 · 数学 2021-11-23 Attila Pethő

There are three families of bivariate polynomial maps associated with the rank-$2$ simple complex Lie algebras $A_2, B_2 \cong C_2$ and $G_2$. It is known that the bivariate polynomial map associated with $A_2$ induces a permutation of…

数论 · 数学 2016-01-27 Ömer Küçüksakallı

In the 1970s Deuber introduced the notion of $(m,p,c)$-sets in $\mathbb{N}$ and showed that these sets are partition regular and contain all linear partition regular configurations in $\mathbb{N}$. In this paper we obtain enhancements and…

组合数学 · 数学 2016-05-13 Vitaly Bergelson , John H. Johnson , Joel Moreira

A subset $R$ of integers is a set of Bohr recurrence if every rotation on $\mathbb{T}^d$ returns arbitrarily close to zero under some non-zero multiple of $R$. We show that the set $\{k!\, 2^m3^n\colon k,m,n\in \mathbb{N}\}$ is a set of…

动力系统 · 数学 2024-11-05 Nikos Frantzikinakis , Bernard Host , Bryna Kra

Let $\mathfrak{g}$ be a finite-dimensional complex simple Lie algebra and $r,m\ge 2$. The universal central extension of the superelliptic current algebra $\mathfrak{g}\otimes A$ is $\widehat{\mathfrak{g}\otimes A}\cong\mathfrak{g}\otimes A…

Answering a question asked by Hsia and Tucker in their paper on the finiteness of greatest common divisors of iterates of polynomials, we prove that if $f, g \in \mathbb{C}(X)$ are compositionally independent rational functions and $c \in…

动力系统 · 数学 2026-02-03 Chatchai Noytaptim , Xiao Zhong

One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…

组合数学 · 数学 2016-09-12 Soumyabrata Pal , Shankar M. Venkatesan

Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…

经典分析与常微分方程 · 数学 2019-01-14 Daniel Duviol Tcheutia

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

计算复杂性 · 计算机科学 2026-03-02 Lianna Hambardzumyan , Shachar Lovett , Morgan Shirley

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

数论 · 数学 2026-02-26 Artyom Radomskii

We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…

逻辑 · 数学 2025-06-09 Mihai Prunescu , Lorenzo Sauras-Altuzarra
‹ 上一页 1 2 3 10 下一页 ›