相关论文: The Narayana Morphism and Related Words
The rigidity theory for circle homeomophisms with breaks was studied intensively in the last 20 years. It was proved that under mild conditions of the Diophantine type on the rotation number any two $C^{2+\alpha}$ smooth circle…
Using Schur positivity and the principal specialization of Schur functions, we provide a proof of a recent conjecture of Liu and Wang on the $q$-log-convexity of the Narayana polynomials, and a proof of the second conjecture that the…
If $f:[a,b]\to \mathbb{R}$, with $a<b$, is continuous and such that $a$ and $b$ are mapped in opposite directions by $f$, then $f$ has a fixed point in $I$. Suppose that $f:\mathbb{C}\to\mathbb{C}$ is map and $X$ is a continuum. We extend…
We reinterpret N=(2,1) strings as describing the continuum limit of matrix theory with all spatial dimensions compactified. Thus they may characterize the full set of degrees of freedom needed to formulate the theory.
In this paper we analyze the $2+1$d conformal fixed points arising from $SU(N_c)$ Chern-Simons-matter theories with multiple flavors $N_f > 1$ in the 't Hooft large $N_c$ limit. The multi-flavor generalization of quasi-fermionic theories…
Let S be an arbitrary scheme. We define biextensions of 1-motives by 1-motives which we see as the geometrical origin of morphisms from the tensor product of two 1-motives to a third one. If S is the spectrum of a field of characteristic 0,…
An interesting phenomenon in combinatorics on words is when every recurrent word satisfying some avoidance constraints has the same factor set as a morphic word. An early example is the Hall-Thue word, fixed point of the morphism…
We study deformations of closed string theory by primary fields of conformal weight $(1,1)$, using conformal techniques on the complex plane. A canonical surface integral formalism for computing commutators in a non-holomorphic theory is…
We construct a deterministic approximation algorithm for computing a permanent of a $0,1$ $n$ by $n$ matrix to within a multiplicative factor $(1+\epsilon)^n$, for arbitrary $\epsilon>0$. When the graph underlying the matrix is a constant…
Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…
A new technique for proving fixed point theorems for families of holomorphic transformations of operator balls is developed. One of these theorems is used to show that a bounded representation in a real or complex Hilbert space is…
The Nicolai map is a field transformation that relates supersymmetric theories at finite couplings $g$ with the free theory at $g=0$. It is obtained via an ordered exponential of the coupling flow operator integrated from $0$ to $g$.…
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…
We prove that arbitrary homomorphisms from one of the groups ${\rm Homeo}(\ca)$, ${\rm Homeo}(\ca)^\N$, ${\rm Aut}(\Q,<)$, ${\rm Homeo}(\R)$, or ${\rm Homeo}(S^1)$ into a separable group are automatically continuous. This has consequences…
This study first defines a new metric with normal structure on C(H,K) and then a new technique to prove fixed point theorems for families of non-expansive maps on this metric space. Indeed, it shows that the presence of a bounded orbit…
Let $n\in \Bbb N-\{1\},$ and let $A$ be a Banach algebra. An additive map $D: A\to A$ is called n-Jordan derivation if $$D(a^n)=D(a)a^{n-1}+aD(a)a^{n-2}+...+a^{n-2}D(a)a+a^{n-1}D(a),$$ for all $a \in {A}$. Using fixed point methods, we…
A sequence of coefficients appearing in a recurrence for the Narayana polynomials is generalized. The coefficients are given a probabilistic interpretation in terms of beta distributed random variables. The recurrence established by M.…
Using combinatorial properties of incomplete sets in a free monoid we construct a series of n-state deterministic automata with zero whose shortest synchronizing word has length n^2/4+n/2-1.
The ambiguity of a nondeterministic finite automaton (NFA) N for input size n is the maximal number of accepting computations of N for an input of size n. For all k, r 2 N we construct languages Lr,k which can be recognized by NFA's with…
We consider two-point correlators in SU(N) gauge theories on R4 with N=2 supersymmetry and Nf massless hypermultiplets in the fundamental representation. Using localization on S4, we compute the leading perturbative corrections to the…