Related papers: Cantorian Tableaux and Permanents

We study finite but growing principal square submatrices $A_n$ of the one- or two-sided infinite Fibonacci Hamiltonian $A$. Our results show that such a sequence $(A_n)$, no matter how the points of truncation are chosen, is always stable…

We show that the CAR algebra admits a Cantor spectrum C*-diagonal that is not conjugate to the standard AF diagonal. We obtain this by classification theory of C*-algebras, and the diagonal arises by realising the CAR algebra as the crossed…

Let K be an algebraically closed field of prime characteristic p, let N be a positive integer, let f be a self-map on the algebraic torus T=G_m^N defined over K, let V be a curve in T defined over K, and let x be a K-point of T. We show…

When working in NF, [1] there is a sense that there are more non-Cantorian sets than Cantorian sets. But it is not that immediate result as one expects, since they are externally equinumerous, and the qualification "Cantorian" is not…

We show that the permanent of an $n \times n$ matrix with iid Bernoulli entries $\pm 1$ is of magnitude $n^{({1/2}+o(1))n}$ with probability $1-o(1)$. In particular, it is almost surely non-zero.

In contrast to the determinant, no algorithm is known for the exact determination of the permanent of a square matrix that runs in time polynomial in its dimension. Consequently, non interacting fermions are classically efficiently…

This paper defines the Iris function and provides two formulations of the matrix permanent. The first formulation, valid for arbitrary complex matrices, expresses the permanent of a complex matrix as a contour integral of a second order…

We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\phi(0)=0^a1$, $\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple…

Let $K/k$ be a finite Galois extension and $\pi = \fn{Gal}(K/k)$. An algebraic torus $T$ defined over $k$ is called a $\pi$-torus if $T\times_{\fn{Spec}(k)} \fn{Spec}(K)\simeq \bm{G}_{m,K}^n$ for some integer $n$. The set of all algebraic…

This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The…

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

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…

We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form $x \overline{x}$), and we completely classify which possibilities can occur. We consider…

We ask the following question: If all instantiations of a propositional formula $A(x_1,...,x_n)$ in $n$ propositional variables are decidable in some sufficiently strong recursive theory, does it follow that $A$ is tautological or…

We consider continued fractions with partial quotients in the ring of integers of a quadratic number field $K$ and we prove a generalization to such continued fractions of the classical theorem of Lagrange. A particular example of these…

There is a natural bijection between standard immaculate tableaux of composition shape $\alpha \vDash n$ and length $\ell(\alpha) = k$ and the $ \left\{ \begin{smallmatrix} n \\ k \end{smallmatrix} \right\} $ set-partitions of $\{ 1, 2,…

Recently Lieb and Seiringer showed that the Bessis-Moussa-Villani conjecture from quantum physics can be restated in the following purely algebraic way: The sum of all words in two positive semidefinite matrices where the number of each of…

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…

We recall Vere-Jones's definition of the $\alpha$--permanent and describe the connection between the (1/2)--permanent and the hafnian. We establish expansion formulae for the $\alpha$--permanent in terms of partitions of the index set, and…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…