Related papers: Cantorian Tableaux and Permanents
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
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…
Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…
We study a class of square matrices with non-negative elements which have cyclically monotone rows in the sense that each row of a matrix from the class consists of a cyclically non-increasing sequence of numbers starting from a maximal…
A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…
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 study the Cantor real base numeration system which is a common generalization of two positional systems, namely the Cantor system with a sequence of integer bases and the R\'enyi system with one real base. We focus on the so-called…
We consider Cantor real numeration system as a frame in which every non-negative real number has a positional representation. The system is defined using a bi-infinite sequence $\Beta=(\beta_n)_{n\in\Z}$ of real numbers greater than one. We…
This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a…
In this paper, we consider the positional numeration system, called the Cantor real expansion, on the unit interval $[\gamma, \gamma+1]$, where $\gamma \in \mathbb{R}$, with respect to an alternate base (i.e., a base which is a purely…
One of the crown jewels of complexity theory is Valiant's 1979 theorem that computing the permanent of an n*n matrix is #P-hard. Here we show that, by using the model of linear-optical quantum computing---and in particular, a universality…
Let $A\in\mathbb{R}^{n\times n}$ be a random matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" in the sense that there is a constant $\varepsilon>0$ such that each entry $a_{ij}$ satisfies…
We prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than…
This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…
We consider intermittent maps T of the interval, with an absolutely continuous invariant probability measure \mu. Kim showed that there exists a sequence of intervals A_n such that \sum \mu(A_n)=\infty, but \{A_n\} does not satisfy the…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
A latin square of order $n$ is an $n\times n$ array of $n$ symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of $n$ entries such that no two entries share the same row, column…
We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…
It is shown that any denumerable list L to which Cantor's diagonal method was applied is incomplete. However, this doesn't allow us to affirm that the cardinality of the real numbers of the interval [0, 1] is greater than the cardinality of…