Related papers: Multigeometric sequences and Cantorvals
Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying…
We give some examples of IFSs with overlap on the interval such that the semigroup action they give rise to has a minimal set homeomorphic to the Cantor set.
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
The questions of the measure and finding open intervals in certain sets of sums and products of elements of the middle third Cantor set (or a variant of it), have generated considerable interest recently. A broad general framework that…
For any odd positive integer $x$, define $(x_n)_{n\geqslant 0} $ and $(a_n )_{n\geqslant 1} $ by setting $x_{0}=x, \,\, x_n =\cfrac{3x_{n-1} +1}{2^{a_n }}$ such that all $x_n $ are odd. The 3x+1 problem asserts that there is an $x_n =1$ for…
A graph is called set-sequential if its vertices can be labeled with distinct nonzero vectors in $\mathbb{F}_2^n$ such that when each edge is labeled with the sum$\pmod{2}$ of its vertices, every nonzero vector in $\mathbb{F}_2^n$ is the…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
It is argued that every measurement is made in a certain scale. The scale in which present measuments are made is called present scale which gives present knowledge. Quantities at the limits to present measurement may be observables in…
Depending on a natural parameter $l$, we study the topological, metric, and fractal properties of the homogeneous self-similar set $$K_{l}=\left\{\sum_{i=1}^{\infty} \frac{\varepsilon_i}{(2l+2)^i} : (\varepsilon_i) \in \{0, 2, 4, \dots, 2l,…
Suppose that $K$ and $ K'$ are two affine Cantor sets. It is shown that the sum set $K+K'$ has equal box and Hausdorff dimensions and in this number named $s$, $H^s(K+K')<\infty$. Moreover, for almost every pair $(K,K')$ satisfying…
For a fixed $c > 0$ we construct an arbitrarily large set $B$ of size $n$ such that its sum set $B+B$ contains a convex sequence of size $cn^2$, answering a question of Hegarty.
The starting point of this work is a theorem due to Maxwell characterizing the distribution of a Gaussian vector with at least two coordinates. We define the Gaussian orthogonal, unitary and symplectic tensor ensembles for notions of real…
Let $X$ be a symplectic variety equipped with an action of a torus $A$. Let $\nu \subset A$ be a finite cyclic subgroup. We show that K-theoretic stable envelope of subvarieties $X^{\nu}\subset X$ can be obtained via various limits of the…
We consider endomorphism algebras of $n$-term silting complexes in derived categories of hereditary algebras, and we show that the module category of such an endomorphism algebra has a separated $n$-section. For $n=3$ we obtain a trisection…
We extend the definition of Jamison sequences in the context of topological abelian groups. Then we study such sequences when the abelian group is discrete and countably infinite. An arithmetical characterization of such sequences is…
The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order.…
Sequences whose terms are equal to the number of functions with specified properties are considered. Properties are based on the notion of derangements in a more general sense. Several sequences which generalize the standard notion of…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
The $LS$-sequences are a parametric family of sequences of points in the unit interval. They were introduced by Carbone, who also proved that under an appropriate choice of the parameters $L$ and $S$, such sequences are low-discrepancy. The…
We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…