相关论文: Cantorian Tableaux and Permanents

It is known that for a uniform morphic sequence $\boldsymbol u = \langle u_n\rangle_{n=0}^\infty$ and an algebraic number $\beta$ such that $|\beta|>1$, the number $[\![\boldsymbol{u} ]\!]_\beta:=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$…

Vacillating tableaux are sequences of integer partitions that satisfy specific conditions. The concept of vacillating tableaux stems from the representation theory of the partition algebra and the combinatorial theory of crossings and…

Let $b$ be an algebraic number with $|b|>1$ and $\mathcal{H}$ a finite set of algebraic numbers. We study the transcendence of numbers of the form $\sum_{n=0}^\infty \frac{a_n}{b^n}$ where $a_n \in \mathcal{H}$ for all $n\in\mathbb{N}$. We…

In relation to the Erd\H os similarity problem (show that for any infinite set $A$ of real numbers there exists a set of positive Lebesgue measure which contains no affine copy of $A$) we give some new examples of infinite sets which are…

Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…

We show that for any pair of self-similar Cantor sets with sum of Hausdorff dimensions greater than 1, one can create an interval in the sumset by applying arbitrary small perturbations (without leaving the class of self-similar Cantor…

The two components for infinite exchangeability of a sequence of distributions $(P_n)$ are (i) consistency, and (ii) finite exchangeability for each $n$. A consequence of the Aldous-Hoover theorem is that any node-exchangeable,…

We suggest that KAM theory could be extended for certain infinite-dimensional systems with purely discrete linear spectrum. We provide empirical arguments for the existence of square summable infinite-dimensional invariant tori in the…

We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate…

For any positive integer $p\geq 3$, let $A$ be a proper subset of $\{0,1,\ldots, p-1\}$ with $\sharp A=s\geq 2$. Suppose $h: \{0,1,\ldots,s-1\}\to A$ is a one-to-one map which is strictly increasing with $A=\{h(0),h(1),\ldots,h(s-1)\}$. We…

A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length over its smallest period. In this article we give a proof of…

We prove that the sequence of the last nonzero digits of factorials in every integer base $b>2$ is not eventually periodic. We also extend the Adamczewski--Bugeaud criterion, originally formulated for integer base expansions, to Cantor base…

A subset of the Cantor cube is null-additive if its algebraic sum with any null set is null. We construct a set of cardinality continuum such that: all continuous images of the set into the Cantor cube are null-additive, it contains a…

We apply an inductive argument to three theorems of Cantor on (1) the uncountability of infinite binary sequences, (2) the uncountability of real numbers, and (3) the non-equinumerosity of sets with their powersets. This technique proves…

We show that the number of length-n words over a k-letter alphabet having no even palindromic prefix is the same as the number of length-n unbordered words, by constructing an explicit bijection between the two sets. A slightly different…

Let $\pi$ be a finite dimensional unitary representation of a group $G$ with a generating symmetric $n$-element set $S\subset G$. Fix $\vp>0$. Assume that the spectrum of $|S|^{-1}\sum_{s\in S} \pi(s) \otimes \overline{\pi(s)}$ is included…

Normal ideals on regular uncountable cardinals are familiar objects. We investigate ideals that are pleasant--while a normal ideal is closed under arbitrary diagonal unions, a pleasant ideal is closed only under diagonal unions indexed by…

We prove that for any sequence of binary alphabets $\mathcal{A}_1,\mathcal{A}_2,\dots$, there exists a cube-free word $c_1c_2\dots$ so that $c_1\in\mathcal{A}_1,c_2\in\mathcal{A}_2,\dots$. In particular, for every $n$, there are at least…

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

It is an old question how massive polynomial hulls of Cantor sets in $\mathbb{C}^n$ can be. In contrast to expectation e.g. Rudin, Vitushkin and Henkin showed on examples that it can be rather massive. Motivated by problems of holomorphic…