Related papers: Additive systems and a theorem of de Bruijn

For nonempty sets $A,B$ of nonnegative integers and an integer $n$, let $r_{A,B}(n)$ be the number of representations of $n$ as $a+b$ and $d_{A,B}(n)$ be the number of representations of $n$ as $a-b$, where $a\in A, b\in B$. In this paper,…

The main result of the paper establishes the irreducibility of a large family of nonzero central charge induced modules over Affine Lie algebras for any non standard parabolic subalgebra. It generalizes all previously known partial results…

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\{ F_i \}_{i = 1}^{\infty}$. A set $S \subset \mathbb{Z}$ is said to satisfy Benford's law if the density…

In the theory of unitary group representations, a group is called type I if all factor representations are of type I, and by a celebrated theorem of James Glimm [Gli61b], the type I groups are precisely those groups for which the…

We describe how previously known methods for determining the number of decimation classes of density $\delta$ binary vectors can be extended to nonnegative integer vectors, where the vectors are indexed by a finite abelian group $G$ of size…

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…

Metabelian algebras are introduced and it is shown that an algebra $A$ is metabelian if and only if $A$ is a nilpotent algebra having the index of nilpotency at most $3$, i.e. $x y z t = 0$, for all $x$, $y$, $z$, $t \in A$. We prove that…

These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

We find necessary and sufficient conditions on a family $\mathcal{R} = (r_i)_{i \in I}$ in a Boolean algebra $\mathcal{B}$ under which there exists a unique positive probability measure $\mu$ on $\mathcal{B}$ such that $\mu (…

A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique…

A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…

We prove conditions ensuring that a Lie ideal or an invariant additive subgroup in a ring contains all additive commutators. A crucial assumption is that the subgroup is fully noncentral, that is, its image in every quotient is noncentral.…

Let $X$ be an $n$-element set. A set-pair system $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ is a collection of pairs of disjoint subsets of $X$. It is called skew Bollob\'as system if $A_i\cap B_j\neq \emptyset$ for all $1\leq i<j \leq…

Complete residue systems play an integral role in abstract algebra and number theory, and a description is typically found in any number theory textbook. This note provides a concise overview of complete residue systems, including a robust…

A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…

We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…

Let $S$ be a finite set, $s=|S|\ge6$. Given a non-negative integer $t$, there exists an inclusion-minimal non-Bondy system $\mathscr{A}$ of size $t$ on $S$ if and only if $s+1\le t\le2s$.

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

Let a be a nonzero integer. If a is not congruent to 4 or 5 modulo 9 then there is no Brauer-Manin obstruction to the existence of integers x, y, z such that x^3+y^3+z^3=a. In addition, there is no Brauer-Manin obstruction to the existence…