Related papers: What is a sequence of Nilsson type?
We study the solutions of irregular A-hypergeometric systems that are constructed from Gr\"obner degenerations with respect to generic positive weight vectors. These are formal logarithmic Puiseux series that belong to explicitly described…
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
In this paper we generalize the well known relation between Heyting algebras and Nelson algebras in the framework of subresiduated lattices. In order to make it possible, we introduce the variety of subresiduated Nelson algebras. The main…
We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of{a_n})_{n\ge 1}$ or the form $(\root{n+1}\of{a_{n+1}}/\root n\of{a_n})_{n\ge1}$, where $(a_n)_{n\ge 1}$ is a…
Motivated by Kalman residuated lattices, Nelson residuated lattices and Nelson paraconsistent residuated lattices, we provide a natural common generalization of them. Nelson conucleus algebras unify these examples and further extend them to…
We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstr\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur…
What is Sequence Algebra? This is a question that any teacher or student of mathematics or computer science can engage with. Sequences are in Calculus, Combinatorics, Statistics and Computation. They are foundational, a step up from number…
For a real-valued sequence $(x_n)_{n=1}^\infty$, denote by $S_N(\ell)$ the number of its first $N$ fractional parts lying in a random interval of size $\ell:=L/N$, where $L=o(N)$ as $N\to\infty$. We study the variance of $S_N(\ell)$ (the…
Let $Y \to E \stackrel{p}{\to} B$ be a fibration and let $f: E \to E$ be a fiber map over $B$. In this work, we study the geometric and algebraic Reidemeister classes of the iterates of $f$ and introduce a Nielsen-type periodic number over…
This is a concise overview of the definitions and properties of the linking number and its higher-order generalization, Milnor invariants.
Scattered sequences are a generalization of scattered polynomials. So far, only scattered sequences of order one and two have been constructed. In this paper an infinite family of scattered sequences of order three is obtained. Equivalence…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The…
We introduce a canonical form for near-normal sequences NN(n), and using it we enumerate the equivalence classes of such sequences for even n up to 30. These sequences are needed for Yang multiplication in the construction of longer…
The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…
We consider some bilinear recurrences that have applications in number theory. The explicit solution of a general three-term bilinear recurrence relation of fourth order is given in terms of the Weierstrass sigma function for an associated…
The sequence of derangements is given by the formula $D_0 = 1, D_n = nD_{n-1} + (-1)^n, n>0$. It is a classical object appearing in combinatorics and number theory. In this paper we consider two classes of sequences: first class is given by…
We develop a new, powerful method for counting elements in a multiset. As a first application, we use this algorithm to study the number of occurrences of patterns in a permutation. For patterns of length 3 there are two Wilf classes, and…
It is a well-known fact that genetic sequences may contain sections with repeated units, called repeats, that differ in length over a population, with a length distribution of geometric type. A simple class of recombination models with…
We study compressible types in the context of (local and global) NIP. By extending a result in machine learning theory (the existence of a bound on the recursive teaching dimension), we prove density of compressible types. Using this, we…