相关论文: Towards a characterization of the star-free sets o…
In the present paper we explore a way to represent numbers with respect to the base $-\frac32$ using the set of digits $\{0,1,2\}$. Although this number system shares several properties with the classical decimal system, it shows remarkable…
A set of integers is called sum-free if it contains no triple $(x,y,z)$ of not necessarily distinct elements with $x+y=z$. In this paper, we provide a structural characterisation of sum-free subsets of $\{1,2,\ldots,n\}$ of density at least…
We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here,…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
We prove that the set of visible points of any lattice of dimension at least 2 has pure point diffraction spectrum, and we determine the diffraction spectrum explicitly. This settles previous speculation on the exact nature of the…
Free coherent states for a system with two degrees of freedom is defined. Existence of the homeomorphism of the ring of integer 2-adic numbers to the set of coherent states corresponding to an eigenvalue of the operator of annihilation is…
A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…
We consider the following counting problem related to the card game SET: How many $k$-element SET-free sets are there in an $n$-dimensional SET deck? Through a series of algebraic reformulations and reinterpretations, we show the answer to…
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
In DOI:10.1017/etds.2022.2 the author proved that for each integer $k$ there is an implicit number $M > 0$ such that if $b_1, \cdots , b_k$ are multiplicatively independent integers greater than $M$, there are infinitely many integers whose…
Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…
Motivated by giving a meaning to "The probability that a random integer has initial digit d", we define a URI-set as a random set E of natural integers such that each n>0 belongs to E with probability 1/n, independently of other integers.…
Cameron introduced a bijection between the set of sum-free sets and the set of all zero-one sequences. In this paper, we study the sum-free sets of natural numbers corresponding to certain zero-one sequences which contain the Cantor-like…
Consider the sets of integers $A$ that avoid any arrangement of $g$ congruent $h$-subsets. Our findings refine and improve upon some results by Erd\H{o}s and Harzheim about these sets.
This note presents an analytic technique for proving the linear independence of certain small subsets of real numbers over the rational numbers. The applications of this test produce simple linear independence proofs for the subsets of…
Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…
The dot-depth hierarchy is a classification of star-free languages. It is related to the quantifier alternation hierarchy of first-order logic over finite words. We consider fragments of languages with dot-depth 1/2 and dot-depth 1 obtained…
Free coherent states for a system with p degrees of freedom are defined. An isomorphism of the space of free coherent states to the space of distributions on p-adic disk is constructed.
Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations, it is NP-complete to decide if a given set of integers…
We analyze the convergence order of an algorithm producing the digits of an absolutely normal number. Furthermore, we introduce a stronger concept of absolute normality by allowing Pisot numbers as bases, which leads to expansions with…