English
Related papers

Related papers: Algebraic Degree Periodicity in Recurrence Sequenc…

200 papers

We consider algebras with basis numerated by elements of a group $G.$ We fix a function $f$ from $G\times G$ to a ground field and give a multiplication of the algebra which depends on $f$. We study the basic properties of such algebras. In…

Rings and Algebras · Mathematics 2012-07-10 S. Albeverio , B. A. Omirov , U. A. Rozikov

We study the finiteness of low degree points on certain modular curves and their Atkin--Lehner quotients, and, as an application, prove the modularity of elliptic curves over all but finitely many totally real fields of degree $5$. On the…

Number Theory · Mathematics 2022-10-18 Yasuhiro Ishitsuka , Tetsushi Ito , Sho Yoshikawa

Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…

Number Theory · Mathematics 2008-03-25 Luigi Cimmino

We consider the space of degree $n\ge 2$ rational maps of the Riemann sphere with $k$ distinct marked periodic orbits of given periods. First, we show that this space is irreducible. For $k=2n-2$ and with some mild restrictions on the…

Dynamical Systems · Mathematics 2014-01-21 Igors Gorbovickis

We study weakly symmetric special biserial algebras of infinite representation type. We show that usually some socle deformation of such an algebra has non-periodic bounded modules. The exceptions are precisely the algebras whose Brauer…

Representation Theory · Mathematics 2016-01-28 Karin Erdmann

The Skolem-Mahler-Lech theorem states that if $f(n)$ is a sequence given by a linear recurrence over a field of characteristic 0,then the set of $m$ such that $f(m)$ is equal to 0 is the union of a finite number of arithmetic progressions…

Number Theory · Mathematics 2007-09-16 Jason P. Bell

We say that the order of an algebraic number $A$ is the minimum of positive integers $k$ such that $A^k$ is rational. In this paper, we show that the number of algebraic numbers $A$ with order $k$ such that \[ A,\ A^A,\ A^{A^A},\ \ldots \]…

Number Theory · Mathematics 2020-01-08 Hirotaka Kobayashi , Kota Saito , Wataru Takeda

Let X be a smooth curve defined over the algebraic numbers, let a,b be algebraic numbers, and let f_l(x) be an algebraic family of rational maps indexed by all l in X. We study whether there exist infinitely many l in X such that both a and…

Number Theory · Mathematics 2015-06-12 Dragos Ghioca , Liang-Chung Hsia , Thomas J. Tucker

Let PG be the Proth-Gilbreath operator that transforms a sequence of integers into the sequence of the absolute values of the differences between all pairs of neighbor terms. Consider the infinite tables obtained by successive iterations of…

Number Theory · Mathematics 2023-07-25 Raghavendra N Bhat , Cristian Cobeli , Alexandru Zaharescu

A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be…

Combinatorics · Mathematics 2018-01-19 Brian Cloteaux , M. Drew LaMar , Elizabeth Moseman , James Shook

We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…

Combinatorics · Mathematics 2025-10-16 Ethan D. Bolker , Debra K. Borkovitz , Katelyn Lee

Kumjian and Pask introduced an aperiodicity condition for higher rank graphs. We present a detailed analysis of when this occurs in certain rank 2 graphs. When the algebra is aperiodic, we give another proof of the simplicity of…

Operator Algebras · Mathematics 2019-08-15 Kenneth R. Davidson , Dilian Yang

Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…

Combinatorics · Mathematics 2026-02-11 Helia Karisani , Mohammadreza Daneshvaramoli

We answer an open question in the theory of degrees of infinite sequences with respect to transducibility by finite-state transducers. An initial study of this partial order of degrees was carried out in (Endrullis, Hendriks, Klop, 2011),…

Formal Languages and Automata Theory · Computer Science 2015-06-03 Jörg Endrullis , Clemens Grabmayer , Dimitri Hendriks , Hans Zantema

In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…

Number Theory · Mathematics 2023-05-22 Arne Winterhof

Continual Lie algebras are infinite-dimensional generalizations of Lie algebras with discrete root system by considering continual root systems. In this paper we establish the general relation between chain complexes and continual Lie…

Functional Analysis · Mathematics 2026-05-20 A. Zuevsky

This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…

Rings and Algebras · Mathematics 2020-04-14 Vesselin Drensky

We consider methods based on the topological degree theory to compute periodic orbits of area preserving maps. Numerical approximations of the Kronecker integral and the application of Stenger's method allows us to compute the value of the…

Chaotic Dynamics · Physics 2007-05-23 C. Polymilis , G. Servizi , Ch. Skokos , G. Turchetti , M. N. Vrahatis

These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…

alg-geom · Mathematics 2008-02-03 János Kollár

Sequences of numbers (either natural integers, or integers or rational) of level $k \in \mathbb{N}$ have been defined in \cite{Fra05,Fra-Sen06} as the sequences which can be computed by deterministic pushdown automata of level $k$. This…

Formal Languages and Automata Theory · Computer Science 2023-10-12 G. Sénizergues