English
Related papers

Related papers: On the representability of sequences as constant t…

200 papers

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Number Theory · Mathematics 2025-06-04 Ritesh Dwivedi , Rohit Yadav

Linear recursions with integer coefficients, such as the one generating the Fibonacci sequence, have been intensely studied over millennia and yet still hide new mathematics. Such a recursion was used by Ap\'ery in his proof of the…

Number Theory · Mathematics 2026-01-30 Nadav Ben David , Guy Nimri , Uri Mendlovic , Yahel Manor , Carlos De la Cruz Mengual , Ido Kaminer

The homology groups of many natural sequences of groups $\{G_n\}_{n=1}^{\infty}$ (e.g. general linear groups, mapping class groups, etc.) stabilize as $n \rightarrow \infty$. Indeed, there is a well-known machine for proving such results…

Algebraic Topology · Mathematics 2017-02-22 Andrew Putman

Following the approach of Rota and Taylor \cite{SIAM}, we present an innovative theory of Sheffer sequences in which the main properties are encoded by using umbrae. This syntax allows us noteworthy computational simplifications and…

Combinatorics · Mathematics 2008-10-21 E. Di Nardo , H. Niederhausen , D. Senato

Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…

Computational Complexity · Computer Science 2015-03-27 Yuichi Yoshida

Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this…

Number Theory · Mathematics 2022-04-25 Roudy El Haddad

In this note, we prove the last remaining case of the original 15 two-term supercongruence conjectures for sporadic sequences. The proof utilizes a new representation for this sequence (due to Gorodetsky) as the constant term of powers of a…

Number Theory · Mathematics 2025-07-14 Brendan Alinquant , Robert Osburn

An oscillating sequence of order $d$ is defined by the linearly disjointness from all $\{e^{2\pi i P(n)} \}_{n=1}^{\infty}$ for all real polynomials $P$ of degree smaller or equal to $d$. A fully oscillating sequence is defined to be an…

Dynamical Systems · Mathematics 2018-04-12 Ruxi Shi

A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel compositions. Since different syntactic terms may represent the…

Logic in Computer Science · Computer Science 2026-02-12 Julie Cailler , Noé Delorme , Simon Perdrix , Sophie Tourret

Tropical recurrent sequences are introduced satisfying a given vector (being a tropical counterpart of classical linear recurrent sequences). We consider the case when Newton polygon of the vector has a single (bounded) edge. In this case…

Algebraic Geometry · Mathematics 2020-02-06 Dima Grigoriev

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…

Classical Analysis and ODEs · Mathematics 2007-11-13 M. Alfaro , F. Marcellan , A. Pena , M. L. Rezola

A finite non-increasing sequence of positive integers $d = (d_1\geq \cdots\geq d_n)$ is called a degree sequence if there is a graph $G = (V,E)$ with $V = \{v_1,\ldots,v_n\}$ and $deg(v_i)=d_i$ for $i=1,\ldots,n$. In that case we say that…

Combinatorics · Mathematics 2021-01-08 Atabey Kaygun

Let A=(a_(ij)) be the generic n by n circulant matrix given by a_(ij)=x_(i+j), with subscripts on x interpreted mod n. Define d(n) (resp. p(n)) to be the number of terms in the determinant (resp. permanent) of A. The function p(n) is…

Combinatorics · Mathematics 2007-05-23 Hugh Thomas

In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…

General Mathematics · Mathematics 2021-06-03 Raouf Rajab

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

Combinatorics · Mathematics 2016-02-02 Razvan Gurau , Gilles Schaeffer

Rational relations are binary relations of finite words that are realised by non-deterministic finite state transducers (NFT). A particular kind of rational relations is the sequential functions. Sequential functions are the functions that…

Formal Languages and Automata Theory · Computer Science 2015-04-16 Ismaël Jecker , Emmanuel Filiot

The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended…

Combinatorics · Mathematics 2011-09-29 Qing-Hu Hou , Hai-Tao Jin

The character of an irreducible admissible representation of a $p$-adic reductive group is known to be a constant function in some neighborhood of any regular semisimple element $\gamma$ in the group. Under certain mild restrictions on…

Representation Theory · Mathematics 2007-05-23 Jonathan Korman

We prove two general results concerning spectral sequences of $\mathbf{FI}$-modules. These results can be used to significantly improve stable ranges in a large portion of the stability theorems for $\mathbf{FI}$-modules currently in the…

Representation Theory · Mathematics 2018-05-09 Thomas Church , Jeremy Miller , Rohit Nagpal , Jens Reinhold

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter
‹ Prev 1 4 5 6 7 8 10 Next ›