Related papers: When all Permutations are Combinatorial Similariti…
Given a symmetric linear transformation on a Hilbert space, a natural problem to consider is the characterization of its set of symmetric extensions. This problem is equivalent to the study of the partial isometric extensions of a fixed…
A self-affine tiling of a compact set G of positive Lebesgue measure is its partition to parallel shifts of a compact set which is affinely similar to G. We find all polyhedral sets (unions of finitely many convex polyhedra) that admit…
The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…
A permutomino of size n is a polyomino determined by particular pairs (P1, P2) of permutations of size n, such that P1(i) is different from P2(i), for all i. Here we determine the combinatorial properties and, in particular, the…
Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…
We present the following reflexivity-like result concerning the automorphism group of the $C^*$-algebra B(H), H being a separable Hilbert space. Let $\phi:B(H)\to B(H)$ be a multiplicative map (no linearity or continuity is assumed) which…
We construct a refined bijection $\phi$ between alternating permutations and 0-1-2 increasing trees with degree at most 2. It satisfies that the first element of alternating permutation $\pi$ is equal to the first vertex in $\phi(\pi)$ in…
A small part of real line which is very close to zero has rich combinatorial properties. The aim of this paper is to express and then prove some locally combinatorial concepts near a virtual idempotent by considering the…
We define the similarity boundary of a self-similar set and use it to analyze the properties of self-similar sets in the general setting of any complete metric space. The similarity boundary is an attempt at extending the concept of the…
A permutiple is a natural number whose representation in some base is an integer multiple of a number whose representation has the same collection of digits. A previous paper utilizes a finite-state-machine construction and its state graph…
We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…
We show that every self conformal measure with respect to a $C^2 (\mathbb{R})$ IFS $\Phi$ has polynomial Fourier decay under some mild and natural non-linearity conditions. In particular, every such measure has polynomial decay if $\Phi$ is…
The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the…
Every multiplier algebra of an irreducible complete Pick kernel arises as the restriction algebra $\mv = \{f\big|_V : f \in \cM_d\}$, where $d$ is some integer or $\infty$, $\cM_d$ is the multiplier algebra of the Drury-Arveson space…
We study self-similar sets and measures on $\mathbb{R}^{d}$. Assuming that the defining iterated function system $\Phi$ does not preserve a proper affine subspace, we show that one of the following holds: (1) the dimension is equal to the…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…
The negative binomial distribution is self similar: If the spectrum over the whole rapidity range gives rise to a negative binomial, in absence of correlation and if the source is unique, also a partial range in rapidity gives rise to the…
A multifiltration is a functor indexed by $\mathbb{N}^r$ that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural $\mathbb{N}^r$-graded $R[x_1,\ldots, x_r]$-module…