中文
相关论文

相关论文: The Narayana Morphism and Related Words

200 篇论文

We obtain sufficient conditions for existence of unique fixed point of Kannan type mappings on complete metric spaces and on generalized complete metric spaces depended an another function.

泛函分析 · 数学 2009-03-10 S. Moradi

Alternating parity automata (APAs) provide a robust formalism for modelling infinite behaviours and play a central role in formal verification. Despite their widespread use, the algebraic theory underlying APAs has remained largely…

逻辑 · 数学 2025-05-16 Anupam Das , Abhishek De

Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…

交换代数 · 数学 2010-03-02 N. Mohan Kumar , Pramod K. Sharma

We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either $\Theta(n^{1+1/k})$ for some $k\in\mathbb N$, or is $O(n \log n)$.

组合数学 · 数学 2015-02-23 Rostislav Devyatov

We study toroidal compactifications of string theories which include compactification of a timelike coordinate. Some new features in the theory of toroidal compactifications arise. Most notably, Narain moduli space does not exist as a…

高能物理 - 理论 · 物理学 2007-05-23 G. Moore

Narayana's sequence is a ternary recurrent sequence defined by the recurrence relation $\mathcal{N}_n=\mathcal{N}_{n-1}+\mathcal{N}_{n-3}$ with initial terms $\mathcal{N}_0=0$ and $\mathcal{N}_1=\mathcal{N}_2=\mathcal{N}_3=1$. Let…

Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three…

形式语言与自动机理论 · 计算机科学 2016-06-02 Luc Dartois , Emmanuel Filiot , Pierre-Alain Reynier , Jean-Marc Talbot

A conformally invariant theory of Majorana fermions in 2<d<4 with O(N) symmetry is studied using Operator Product Expansions and consistency relations based on the cancellation of shadow singularities. The critical coupling G_{*} of the…

高能物理 - 理论 · 物理学 2009-10-30 Anastasios C. Petkou

A nilspace system is a generalization of a nilsystem, consisting of a compact nilspace X equipped with a group of nilspace translations acting on X. Nilspace systems appear in different guises in several recent works, and this motivates the…

动力系统 · 数学 2020-10-07 Pablo Candela , Diego González-Sánchez , Balázs Szegedy

It is known that every homeomorphism of the plane has a fixed point in a non-separating, invariant subcontinuum. Easy examples show that a branched covering map of the plane can be periodic point free. In this paper we show that any…

一般拓扑 · 数学 2016-01-25 A. Blokh , L. Oversteegen

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

离散数学 · 计算机科学 2007-05-23 Yuri Pritykin

The complexity and decidability of various decision problems involving the shuffle operation are studied. The following three problems are all shown to be $NP$-complete: given a nondeterministic finite automaton (NFA) $M$, and two words $u$…

形式语言与自动机理论 · 计算机科学 2019-03-08 Joey Eremondi , Oscar H. Ibarra , Ian McQuillan

The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…

组合数学 · 数学 2024-06-17 Praise Adeyemo

We show that an identity of Kreweras for the Narayana numbers counts Dyck paths with a given number of peaks by number of peak plateaus, where a peak plateau is a run of consecutive peaks that is immediately preceded by an upstep and…

组合数学 · 数学 2012-03-20 David Callan

Let $(N_{n})_{n\ge 0}$ be Narayana's cows sequence given by a recurrence relation $ N_{n+3}=N_{n+2}+N_n $ for all $ n\ge 0 $, with initial conditions $ N_0=0 $, and $ N_1= N_2=1 $. In this paper, we find all members in Narayana's cow…

数论 · 数学 2024-01-01 Mahadi Ddamulira , Paul Emong , Geoffrey Ismail Mirumbe

Every language in NL has a $k$-head two-way nondeterministic finite automaton (2nfa($k$)) recognizing it. It is known how to build a constant-space verifier algorithm from a 2nfa($k$) for the same language with constant-randomness, but with…

计算复杂性 · 计算机科学 2022-06-03 M. Utkan Gezer

We compare a piecewise linear map with constant slope beta>1 and a piecewise linear map with constant slope -beta. These maps are called the positive and negative beta-transformations. We show that for a certain set of beta's, the…

动力系统 · 数学 2019-02-20 Charlene Kalle

The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to…

形式语言与自动机理论 · 计算机科学 2015-07-01 Thomas Colcombet

The Nakayama automorphism of a class of connected graded Artin-Schelter regular algebras is calculated explicitly.

环与代数 · 数学 2015-12-03 J. -F. Lü , X. -F. Mao , J. J. Zhang

We define the notion of a specialization morphism from a locally noetherian analytic adic space to a scheme. This captures the (classical) specialization morphism associated to a formal scheme. There is a well behaved theory of…

代数几何 · 数学 2021-03-30 Ildar Gaisin , John Welliaveetil