Related papers: Integer Cantor Sets: Arithmetic Combinatorial Prop…
For alternate Cantor real base numeration systems we generalize the result of Frougny and~Solomyak on~arithmetics on the set of numbers with finite expansion. We provide a class of alternate bases which satisfy the so-called finiteness…
When one inserts a number of identical bars in between blocks of an ordered set partition, they get a barred preferential arrangement. In this study we define a new generalization of barred preferential arrangements, by considering barred…
We give several families of polynomials which are related by Eulerian summation operators. They satisfy interesting combinatorial properties like being integer-valued at integral points. This involves nearby-symmetries and a recursion for…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…
We give sufficient conditions for two Cantor sets of the line to be nested for a positive set of translation parameters. This problem occurs in diophantine approximations. It also occurs as a toy model of the parameter selection for…
We present the characterization of metric spaces that are micro-, macro- or bi-uniformly equivalent to the extended Cantor set $\{\sum_{i=-n}^\infty\frac{2x_i}{3^i}:n\in\IN ,\;(x_i)_{i\in\IZ}\in\{0,1\}^\IZ\}\subset\IR$, which is…
We give conditions under which certain digit-restricted integer sets avoid $k$-term arithmetic progressions. These sets and their harmonic sums can be computed efficiently. Through large-scale search, we identify integer sets avoiding…
Let $\mathcal{P} \subset \mathbb{R}^N$ be an integral convex polytope of dimension $d$ and write $k \mathcal{P}$, where $k = 1, 2, \ldots$, for dilations of $\mathcal{P}$. We say that $\mathcal{P}$ possesses the integer decomposition…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
We consider (not self-similar) Cantor sets defined by a sequence of piecewise linear functions. We prove that the dimension of the harmonic measure on such a set is strictly smaller than its Hausdorff dimension. Some Hausdorff measure…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
The lazy algorithm for a real base $\beta$ is generalized to the setting of Cantor bases $\boldsymbol{\beta}=(\beta_n)_{n\in \mathbb{N}}$ introduced recently by Charlier and the author. To do so, let $x_{\boldsymbol{\beta}}$ be the greatest…
In this paper we give an attempt to extend some arithmetic properties such as multiplicativity, convolution products to the setting of operators theory. We provide a significant examples which are of interest in number theory. We also give…
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…
Integer compositions with certain colored parts were introduced by Andrews in 2007 to address a number-theoretic problem. Integer compositions allowing zero as some parts were introduced by Ouvry and Polychronakos in 2019. We give a…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
In this paper, motivated by the theory of operads and PROPs we reveal the combinatorial nature of tensor calculus for strict tensor categories and show that there exists a monad which is described by the coarse-graining of graphs and…