English
Related papers

Related papers: Factorization of C-finite Sequences

200 papers

A sequence is a fractal sequence if it contains itself as a proper subsequence. (The self-containment property resembles that of visual fractals) A doubly fractal sequence of integers is defined by operations called upper trimming and lower…

Number Theory · Mathematics 2017-01-02 Matin Amini , Majid Jahangiri

We construct an infinite family of real cyclotomic fields with non-trivial class group. This result generalizes the result in [1] in the sense that our family includes theirs.

Number Theory · Mathematics 2022-05-17 Om Prakash

Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…

Classical Analysis and ODEs · Mathematics 2025-11-17 Alex Kasman , Robert Milson

We provide a complete classification of the singularities of cluster algebras of finite type with trivial coefficients. Alongside, we develop a constructive desingularization of these singularities via blowups in regular centers over fields…

Algebraic Geometry · Mathematics 2022-06-01 Angelica Benito , Eleonore Faber , Hussein Mourtada , Bernd Schober

In this note, we consider the problem of generating $k$-factorable graphic sequences with connected (resp. no connected) $k$-factors.

Data Structures and Algorithms · Computer Science 2024-10-28 Asish Mukhopadhyay , Daniel John , Lucas Sarweh

In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…

Number Theory · Mathematics 2015-07-20 Jeremy Alm , Taylor Herald

Let $S$ and $\mathcal{C}$ be affine semigroups in $\mathbb{N}^d$ such that $S\subseteq \mathcal{C}$. We provide a characterization for the set $\mathcal{C}\setminus S$ to be finite, together with a procedure and computational tools to check…

Commutative Algebra · Mathematics 2024-02-09 Carmelo Cisto

In this note we classify sequences according to whether they are morphic, pure morphic, uniform morphic, pure uniform morphic, primitive morphic, or pure primitive morphic, and for each possibility we either give an example or prove that no…

Formal Languages and Automata Theory · Computer Science 2017-11-30 Jean-Paul Allouche , Julien Cassaigne , Jeffrey Shallit , Luca Q. Zamboni

We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.

Formal Languages and Automata Theory · Computer Science 2020-12-15 Hideo Bannai , Travis Gagie , Shunsuke Inenaga , Juha Karkkainen , Dominik Kempa , Marcin Piatkowski , Simon J. Puglisi , Shiho Sugimoto

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

Number Theory · Mathematics 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

We show that certain terminating $_{6}\phi_5$ series can be factorized into a product of two $_{3}\phi_{2}$ series. As applications we prove a summation formula for a product of two $q$-Delannoy numbers along with some congruences for sums…

Combinatorics · Mathematics 2017-04-18 Hong-Fang Guo , Victor J. W. Guo , Jiang Zeng

The paper gives some criteria for partial sums of rational number sequences to be not rational functions and to be not algebraic functions. As an application, we study partial sums of some famous rational number sequences in mathematical…

Commutative Algebra · Mathematics 2014-06-06 Duong Quoc Viet , Truong Thi Hong Thanh

Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…

Formal Languages and Automata Theory · Computer Science 2023-11-30 Jeffrey Shallit , Xinhao Xu

All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…

Group Theory · Mathematics 2007-05-23 V. V. Genk

In this paper we present a method to pass from a recurrence relation having constant coefficients (in short, a C-recurrence) to a finite succession rule defining the same number sequence. We recall that succession rules are a recently…

Discrete Mathematics · Computer Science 2013-01-15 Stefano Bilotta , Elisa Pergola , Renzo Pinzani , Simone Rinaldi

We study the probability that the product of two randomly chosen elements in a finite ring $R$ is equal to some fixed element $x \in R$. We calculate this probability for semisimple rings and some special classes of local rings, and find…

Rings and Algebras · Mathematics 2025-04-18 David Dolžan

A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…

Rings and Algebras · Mathematics 2018-03-30 Daniel P. Bossaller , Sergio R. López-Permouth

In this paper, we study the product of orders of composition factors of odd order in a composition series of a finite linear group. First we generalize a result by Manz and Wolf about the order of solvable linear groups of odd order. Then…

Group Theory · Mathematics 2020-06-09 Alexander Betz , Max Chao-Haft , Ting Gong , Anthony Ter-Saakov , Yong Yang

We provide a complete classification of the singularities of cluster algebras of finite cluster type. This extends our previous work about the case of trivial coefficients. Additionally, we classify the singularities of cluster algebras for…

Algebraic Geometry · Mathematics 2025-09-23 Angélica Benito , Eleonore Faber , Hussein Mourtada , Bernd Schober

Two types of finite series of products of harmonic numbers involving nonnegative integer powers are evaluated, also yielding two other important harmonic number identities. The recursion formulas for these sums are derived, which are easily…

Number Theory · Mathematics 2012-02-23 Maarten Kronenburg