相关论文: Short history of signed exceptional sequences
We show that the number of short binary signed-digit representations of an integer $n$ is equal to the $n$-th term in the Stern sequence. Various proofs are provided, including direct, bijective, and generating function proofs. We also show…
The purpose of this memoir is to discuss two very interesting properties of integer sequences. One is the law of apparition and the other is the law of repetition. Both have been extensively studied by mathematicians such as Ward, Lucas,…
The so-called $T$-sequences $\mathbf u$ in a group $G$, and the related finest Hausdorff group topology $T_\mathbf u$ on $G$ that makes $\mathbf u$ a null sequence, were introduced by Protasov and Zelenyuk 35 years ago and since then they…
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
In 1986, some examples of algebraic, and nonquadratic, power series over a finite prime field, having a continued fraction expansion with partial quotients all of degree one, were discovered by W. Mills and D. Robbins. In this note we show…
Let $C^*(E)$ be the graph $C^*$-algebra associated to a graph E and let J be a gauge invariant ideal in $C^*(E)$. We compute the cyclic six-term exact sequence in $K$-theory of the associated extension in terms of the adjacency matrix…
We study combinatorial structures arising from finite-time transition probabilities of the Totally Asymmetric Simple Exclusion Process with open boundary conditions. While much of the existing combinatorial theory regarding the TASEP…
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…
In this paper, we provide properties and applications of some special integer sequences. We generalize and give some properties of Pisano period. Moreover, we provide a new application in Cryptography and applications of some quaternion…
The combined trace (i.e., comtrace) notion was introduced by Janicki and Koutny in 1995 as a generalization of the Mazurkiewicz trace notion. Comtraces are congruence classes of step sequences, where the congruence relation is defined from…
In this paper, we consider several special polynomials related to associated sequences of polynomials. Finally, we give some new and interesting identities of those polynomials arising from transfer formula for the associated sequences.
We classify spherical modules and full exceptional sequences of modules over the Auslander algebra of $k[x]/(x^t)$. We categorify the left and right symmetric group actions on these exceptional sequences to two braid group actions: of…
In 2012, Andrews and Merca proved a truncated theorem on Euler's pentagonal number theorem, which opened up a new study on truncated theta series. In particular, some truncated versions of a identity of Gauss have been proved. In this…
We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the $n$th term of the sequence as being the total weight of the integer $n$ written in base $k$.…
Even if it has been less than a decade and a half since Tian introduced his concept of evolution algebras to represent algebraically non-Mendelian rules in Genetics, their study is becoming increasingly widespread mainly due to their…
In the cluster algebra literature, the notion of a graded cluster algebra has been implicit since the origin of the subject. In this work, we wish to bring this aspect of cluster algebra theory to the foreground and promote its study. We…
The completely regular codes in Hamming graphs have a high degree of combinatorial symmetry and have attracted a lot of interest since their introduction in 1973 by Delsarte. This paper studies the subfamily of completely transitive codes,…
A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e.,…
In 2004, Y. Hu and G. Xiao introduced the generalized self-shrinking generator, a simple bit-stream generator considered as a specialization of the shrinking generator as well as a generalization of the self-shrinking generator. The authors…
Recursive distinctioning (RD) is a name coined by Joel Isaacson in his original patent document describing how fundamental patterns of process arise from the systematic application of operations of distinction and description upon…