相关论文: Repetitions in beta-integers

Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…

We give combinatorial proofs of the formulas for the number of multichains in the $k$-divisible noncrossing partitions of classical types with certain conditions on the rank and the block size due to Krattenthaler and M{\"u}ller. We also…

We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…

In crystallography, a structure is typically represented by the arrangement of atoms in the direct space. Furthermore, space group symmetry and Wyckoff site notations are applied to characterize crystal structures with only a few variables.…

Let $x$ be a periodic continued fraction with the initial block $0$ and the repeating block $c_1,\ldots,c_n$. So $x$ is a quadratic irrational of the form $x=a+\sqrt b$, where $a$, $b$ are rational numbers, $b>0$, $b$ not a square. The…

In this paper, we propose to enumerate all different configurations belonging to a specific class of fractals: A binary initial tile is selected and a finite recursive tiling process is engaged to produce auto-similar binary patterns. For…

Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of…

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

An existing dialogue between number theory and dynamical systems is advanced. A combinatorial device gives necessary and sufficient conditions for a sequence of non-negative integers to count the periodic points in a dynamical system. This…

We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…

The study of granular crystals, metamaterials that consist of closely packed arrays of particles that interact elastically, is a vibrant area of research that combines ideas from disciplines such as materials science, nonlinear dynamics,…

Vacillating tableaux are sequences of integer partitions that satisfy specific conditions. The concept of vacillating tableaux stems from the representation theory of the partition algebra and the combinatorial theory of crossings and…

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like…

An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…

It has been a well-known fact since Euclid's time that there exist infinitely many rational primes. Two natural questions arise: In which other rings, sufficiently similar to the integers, are there infinitely many irreducible elements? Is…

The $(-\beta)$-integers are natural generalisations of the $\beta$-integers, and thus of the integers, for negative real bases. When $\beta$ is the analogue of a Parry number, we describe the structure of the set of $(-\beta)$-integers by a…

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…

Given two finite sequences of positive integers $\alpha$ and $\beta$, we associate a square free monomial ideal $I_{\alpha,\beta}$ in a ring of polynomials $S$, and we recursively compute the algebraic invariants of $S/I_{\alpha,\beta}$.…

We give a characterization of finite sets of triples of elements (e.g., positive integers) that can be colored with two colors such that for every element $i$ in each color class there exists a triple which does not contain $i$. We give a…