English
Related papers

Related papers: Factorization of C-finite Sequences

200 papers

This paper is concerned with the problem of determining the number of division algebras which share the same collection of finite splitting fields. As a corollary we are able to determine when two central division algebras may be…

Rings and Algebras · Mathematics 2010-01-22 Daniel Krashen , Kelly McKinnie

We determine all the ways in which a direct product of two finite groups can be expressed as the set-theoretical union of proper subgroups in a family of minimal cardinality.

Group Theory · Mathematics 2012-11-26 Andrea Lucchini , Martino Garonzi

In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…

Number Theory · Mathematics 2016-05-04 Alain Lasjaunias , Jia-Yan Yao

Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…

Functional Analysis · Mathematics 2025-03-05 Dávid Papp , Kolos Csaba Ágoston

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…

Group Theory · Mathematics 2026-04-23 Mikhail Kabenyuk

The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide…

Symbolic Computation · Computer Science 2018-09-19 Peter Paule , Carsten Schneider

We introduce the new concept of joint nonlinear complexity for multisequences over finite fields and we analyze the joint nonlinear complexity of two families of explicit inversive multisequences. We also establish a probabilistic result on…

Information Theory · Computer Science 2014-11-11 Wilfried Meidl , Harald Niederreiter

We define a two-variable polynomial invariant of finite quandles. In many cases this invariant completely determines the algebraic structure of the quandle up to isomorphism. We use this polynomial to define a family of link invariants…

Quantum Algebra · Mathematics 2008-08-13 Sam Nelson

The paper considers computable Folner sequences in computably enumerable amenable groups. We extend some basic results of M. Cavaleri on existence of such sequences to the case of groups where finite generation is not assumed. We also…

Group Theory · Mathematics 2025-10-14 Karol Duda , Aleksander Ivanov

The paper investigates the properties of a nonlinear recursive sequence which includes several ones studied formerly in the literature.

Dynamical Systems · Mathematics 2009-09-14 M. Delasen

An $f$-subgroup is a linear recurring sequence subgroup, a multiplicative subgroup of a field whose elements can be generated (without repetition) by a linear recurrence relation, with characteristic polynomial $f$. It is called…

Combinatorics · Mathematics 2021-03-26 Henk D. L. Hollmann , Medet Zhanbulatuly

An elementary method for computing various prime sequences using the sequence of Farey sequences is described.

Number Theory · Mathematics 2011-03-24 Scott B. Guthery

We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…

Information Theory · Computer Science 2013-12-06 Harald Niederreiter , Chaoping Xing

A domain $R$ is said to have the finite factorization property if every nonzero non-unit element of $R$ has at least one and at most finitely many distinct factorizations up to multiplication of irreducible factors by central units. Let $k$…

Rings and Algebras · Mathematics 2019-03-06 Jason P. Bell , Albert Heinle , Viktor Levandovskyy

In this note we study the convergence of recursively defined infinite series. We explore the role of the derivative of the defining function at the origin (if it exists), and develop a comparison test for such series which can be used even…

Classical Analysis and ODEs · Mathematics 2018-03-16 Tamás Forgács , Jack Luong , Joshua Williamson

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

Group Theory · Mathematics 2026-03-10 Alfred Geroldinger , Zachary Mesyan

The regularized product of the Fibonacci numbers is evaluated.

History and Overview · Mathematics 2007-05-23 Adrian R. Kitson

Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…

Commutative Algebra · Mathematics 2024-09-05 D. Marín-Aragón , R. Tapia-Ramos

We show that for any pair of non-trivial finite groups, their coproduct in the category of finite groups is not representable.

Group Theory · Mathematics 2017-05-12 Chris Hall

This is the central article of a series of three papers on cross product bialgebras. We present a universal theory of bialgebra factorizations (or cross product bialgebras) with cocycles and dual cocycles. We also provide an equivalent…

Quantum Algebra · Mathematics 2009-09-25 Yuri Bespalov , Bernhard Drabant