English
Related papers

Related papers: Intertwining of Complementary Thue-Morse Factors

200 papers

An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…

Representation Theory · Mathematics 2012-01-09 Krasimir Yordzhev , Hristina Kostadinova

This note is devoted to the intertwining operator in the one--dimensional trigonometric Dunkl setting. We obtain a simple integral expression of this operator and deduce its positivity.

Classical Analysis and ODEs · Mathematics 2017-02-03 Jean-Philippe Anker

Fixed points ${\bf u}=\varphi({\bf u})$ of marked and primitive morphisms $\varphi$ over arbitrary alphabet are considered. We show that if ${\bf u}$ is palindromic, i.e., its language contains infinitely many palindromes, then some power…

Combinatorics · Mathematics 2015-09-14 Sébastien Labbé , Edita Pelantová

This note is mostly an expository survey, centered on the topology of complements of hyperplane arrangements, their Milnor fibrations, and their boundary structures. An important tool in this study is provided by the degree 1 resonance and…

Algebraic Topology · Mathematics 2017-03-16 Alexandru I. Suciu

By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power…

Number Theory · Mathematics 2025-10-31 Bernd C. Kellner

We give formulae for the cumulants of complex Wishart (LUE) and inverse Wishart matrices (inverse LUE). Their large-$N$ expansions are generating functions of double (strictly and weakly) monotone Hurwitz numbers which count constrained…

Mathematical Physics · Physics 2021-04-12 Fabio Deelan Cunden , Antoine Dahlqvist , Neil O'Connell

General first- and higher-order intertwining relations between non-stationary one-dimensional Schr\"odinger operators are introduced. For the first-order case it is shown that the intertwining relations imply some hidden symmetry which in…

Quantum Physics · Physics 2008-11-26 F. Cannata , M. Ioffe , G. Junker , D. Nishnianidze

In the theory of programming languages, type inference is the process of inferring the type of an expression automatically, often making use of information from the context in which the expression appears. Such mechanisms turn out to be…

Logic in Computer Science · Computer Science 2012-05-10 Jeremy Avigad

We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…

Combinatorics · Mathematics 2020-08-25 Jacob Sprittulla

It is known that the eigenvalues of selfadjoint elements a,b,c with a+b+c=0 in the factor R^omega (ultrapower of the hyperfinite II1 factor) are characterized by a system of inequalities analogous to the classical Horn inequalities of…

Operator Algebras · Mathematics 2019-02-27 H. Bercovici , B. Collins , K. Dykema , W. S. Li , D. Timotin

We consider a measure of similarity for infinite words that generalizes the notion of asymptotic or natural density of subsets of natural numbers from number theory. We show that every overlap-free infinite binary word, other than the…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Chen Fei Du , Jeffrey Shallit

This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof…

Geometric Topology · Mathematics 2009-09-29 Louis H. Kauffman , Sofia Lambropoulou

A simple recurrence relation for the even order moments of the Fabius function is proven. Also, a very similar formula for the odd order moments in terms of the even order moments is proved. The matrices corresponding to these formulas (and…

Classical Analysis and ODEs · Mathematics 2017-03-07 Søren G. Have

We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n) <= n for n >= 4 and that f(n) = n infinitely…

Formal Languages and Automata Theory · Computer Science 2012-11-07 Daniel Goc , Hamoon Mousavi , Jeffrey Shallit

Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in Fibonacci representation. In this note we show how, using the Walnut theorem-prover, to obtain a measure of its complexity, previously studied by Jamet, Popoli, and…

Formal Languages and Automata Theory · Computer Science 2022-03-22 Jeffrey Shallit

We prove the famous Faber intersection number conjecture and other more general results by using a recursion formula of $n$-point functions for intersection numbers on moduli spaces of curves. We also present some vanishing properties of…

Algebraic Geometry · Mathematics 2011-03-24 Kefeng Liu , Hao Xu

Let $q$ be a positive integer. Consider an infinite word $\omega=w_0w_1w_2\cdots$ over an alphabet of cardinality $q$. A finite word $u$ is called an arithmetic factor of $\omega$ if $u=w_cw_{c+d}w_{c+2d}\cdots w_{c+(|u|-1)d}$ for some…

Combinatorics · Mathematics 2018-11-12 Olga Parshina

We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier…

Quantum Algebra · Mathematics 2007-05-23 Andrei Okounkov

Two point correlation functions of the off-critical primary fields \phi_{1, 1+s} are considered in the perturbed minimal models M_{2, 2N+3} + \phi_{1,3}. They are given as infinite series of form factor contributions. The form factors of…

High Energy Physics - Theory · Physics 2008-11-26 Takeshi Oota

An inductive inference system for proving validity of formulas in the initial algebra $T_{\mathcal{E}}$ of an order-sorted equational theory $\mathcal{E}$ is presented. It has 20 inference rules, but only 9 of them require user interaction;…

Logic in Computer Science · Computer Science 2024-05-07 Jose Meseguer
‹ Prev 1 3 4 5 6 7 10 Next ›