中文
相关论文

相关论文: The Ultimate Signs of Second-Order Holonomic Seque…

200 篇论文

Let a finite non-empty X is equipped with discrete topology. We prove that S \subseteq X^\omega is of second category if and only if for each f:\omega -> \bigcup_{n \in \omega} X^n there exists a sequence {a_n}_{n \in \omega} belonging to S…

逻辑 · 数学 2007-05-23 Apoloniusz Tyszka

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

数论 · 数学 2022-06-22 Sergiy Koshkin

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

综合数学 · 数学 2007-05-23 W. Mueckenheim

The $N$th linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large $N$th linear complexity. However, in this paper we show that for $q$-automatic sequences over $\mathbb{F}_q$ the converse…

数论 · 数学 2017-11-30 László Mérai , Arne Winterhof

The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…

逻辑 · 数学 2014-02-10 Itaï Ben Yaacov , Arthur Paul Pedersen

Let $r_1,\ldots,r_s:\mathbb{Z}_{n\geqslant 0}\to\mathbb{C}$ be linearly recurrent sequences whose associated eigenvalues have arguments in $\pi\mathbb{Q}$ and let $F(z):=\sum_{n\geqslant 0}f(n)z^n$, where $f(n)\in\{r_1(n),\ldots,$…

数论 · 数学 2017-09-05 Michael Coons

The set of all subspaces of $\mathbb{F}_q^n$ is denoted by $\mathbb{P}_q(n)$. The subspace distance $d_S(X,Y) = \dim(X)+ \dim(Y) - 2\dim(X \cap Y)$ defined on $\mathbb{P}_q(n)$ turns it into a natural coding space for error correction in…

信息论 · 计算机科学 2014-10-13 Srikanth Pai , B. Sundar Rajan

For any real division algebra A of finite dimension greater than one, the signs of the determinants of left multiplication and right multiplication by a non-zero element are shown to form an invariant of A, called its double sign. The…

环与代数 · 数学 2011-10-13 Erik Darpö , Ernst Dieterich

Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…

数论 · 数学 2026-04-13 Ruofan Li

Given $\{P_n \}$ a sequence of monic orthogonal polynomials, we analyze their linear combinations $\{Q_n \}$with constant coefficients and fixed length $k+1$. Necessary and sufficient conditions are given for the orthogonality of the monic…

经典分析与常微分方程 · 数学 2007-11-13 M. Alfaro , F. Marcellan , A. Pena , M. L. Rezola

We solve the first-order classification problem for rings $R$ of polynomials $F[x_1, \ldots,x_n]$ and Laurent polynomials $F[x_1,x_1^{-1}, \ldots,x_n,x_n^{-1}]$ with coefficients in an infinite field $F$ or the ring of integers $\mathbb Z$,…

逻辑 · 数学 2024-09-24 Alexei Myasnikov , Andrey Nikolaev

Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…

数论 · 数学 2022-04-18 Bing Li , Ruofan Li , Yufeng Wu

Let $q$ be a power of a prime $p$, let $\mathbb F_q$ be the finite field with $q$ elements and, for each nonconstant polynomial $F\in \mathbb F_{q}[X]$ and each integer $n\ge 1$, let $s_F(n)$ be the degree of the splitting field (over…

数论 · 数学 2025-08-13 Lucas Reis

If a real polynomial $f(x)=p(x^2)+xq(x^2)$ is Hurwitz stable (every root if $f$ lies in the open left half-plane), then the Hermite-Biehler Theorem says that the polynomials $p(-x^2)$ and $q(-x^2)$ have interlacing real roots. We extend…

经典分析与常微分方程 · 数学 2017-01-30 Richard Ellard , Helena Šmigoc

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

代数几何 · 数学 2013-10-22 Abdallah Assi

Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…

数论 · 数学 2025-01-31 Zbigniew Lipinski , Maciej P. Wojtkowski

Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…

逻辑 · 数学 2024-09-24 Fedor Pakhomov , Michael Rathjen , Dino Rossegger

We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…

We say that a first order sentence A defines a graph G if A is true on G but false on any graph non-isomorphic to G. Let L(G) (resp. D(G)) denote the minimum length (resp. quantifier rank) of a such sentence. We define the succinctness…

逻辑 · 数学 2007-05-23 Oleg Pikhurko , Joel Spencer , Oleg Verbitsky