Related papers: Factorization of C-finite Sequences

We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light an 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we…

We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending work of Biane. We deduce from our result a…

Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of so-called descent 1-cocyles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid…

In this paper we introduce and study the concept of cyclic factorization number of a finite group G. By using the Mobius inversion formula and other methods involving the cyclic subgroup structure, this is explicitly computed for some…

In an earlier paper we introduced the notion of 'bifurcating continued fractions' in a heuristic manner. In this paper a formal theory is developed for the 'bifurcating continued fractions'.

Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

We describe how noncommutative function algebras built from noncommutative functions in the sense of \cite{K-VV2014} may be studied as subalgebras of homogeneous $C^{*}$-algebras.

These notes answer the question "When can a finite Blaschke product $B$ be written as a composition of two finite Blaschke products $B_1$ and $B_2$, that is, $B=B_1\circ B_2$, in a non-trivial way, that is, where the order of each is…

We give two characterizations of tracially nuclear C*-algebras. The first is that the finite summand of the second dual is hyperfinite. The second is in terms of a variant of the weak* uniqueness property. The necessary condition holds for…

We attempt to describe the rank 2 vector bundles on a curve C which are specializations of the trivial bundle. We get a complete classifications when C is Brill-Noether generic, or when it is hyperelliptic; in both cases all limit vector…

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…

We classify those sequences $\langle S_{n} \mid n \in \mathbb{N} \rangle$ of finite simple nonabelian groups such that the full product $\prod_{n} S_{n}$ has property (FA).

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

Let $G:= (C^*)^k\times SL_2(C)$ act linearly on a vector space or its projectivisation. We obtain an effective criterion to detect whether a number of orbits in an orbit-closure is finite or not.

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

When a set of permutations comprising a pattern class C is submitted as input to a priority queue the resulting output is again a pattern class C'. The basis of C' is determined for pattern classes C whose basis elements have length 3, and…