English
Related papers

Related papers: Normal basises and symbolical dynamics

200 papers

Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…

Logic in Computer Science · Computer Science 2023-06-22 Brijesh Dongol , Ian J. Hayes , Georg Struth

Occurrences of a factor $w$ in an infinite uniformly recurrent sequence ${\bf u}$ can be encoded by an infinite sequence over a finite alphabet. This sequence is usually denoted ${\bf d_{\bf u}}(w)$ and called the derived sequence to $w$ in…

Dynamical Systems · Mathematics 2019-08-30 Edita Pelantová , Štěpán Starosta

We formulate the dynamics of an infinitely extended open dissipative quantum system, ${\Sigma]$,in the Schroedinger picture.The generic model on which this is based comprises a C*-algebra,$[\cal A}$,of observables, a folium, ${\cal F}$, of…

Mathematical Physics · Physics 2020-08-07 Geoffrey L. Sewell

We investigate the algebra generated by the operators $x$ and $\mathrm{I} = \int_0^x$, which satisfy the commutation relation \[ [\mathrm{I},x] = \mathrm{I}x - x\mathrm{I} = - \mathrm{I}^2. \] We develop a combinatorial framework for the…

Combinatorics · Mathematics 2025-12-02 Abdelhay Benmoussa

A unified description of the relationship between the Hamiltonian structure of a large class of integrable hierarchies of equations and W-algebras is discussed. The main result is an explicit formula showing that the former can be…

High Energy Physics - Theory · Physics 2007-05-23 C. R. Fernández-Pousa , M. V. Gallas , J. L. Miramontes , J. Sánchez Guillén

New realizations of finite W algebras are constructed by relaxing the usual constraint conditions. Then, finite W algebras are recognized in the Heisenberg quantization recently proposed by Leinaas and Myrheim, for a system of two identical…

High Energy Physics - Theory · Physics 2009-10-28 F. Barbarin , E. Ragoucy , P. Sorba

In this paper we introduce and study a new property of infinite words: An infinite word $x\in A^\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\geq 2)$ if $x$ admits factorizations: $x=\prod_{i=0}^\infty…

Combinatorics · Mathematics 2014-11-17 Émilie Charlier , Teturo Kamae , Svetlana Puzynina , Luca Q. Zamboni

There is much interest in providing probabilistic semantics for defaults but most approaches seem to suffer from one of two problems: either they require numbers, a problem defaults were intended to avoid, or they generate peculiar side…

Artificial Intelligence · Computer Science 2013-04-10 Eric Neufeld , David L Poole

We present abstraction techniques that transform a given non-linear dynamical system into a linear system or an algebraic system described by polynomials of bounded degree, such that, invariant properties of the resulting abstraction can be…

Symbolic Computation · Computer Science 2012-04-20 Sriram Sankaranarayanan

It is described how the standard Poisson bracket formulas should be modified in order to incorporate integrals of divergences into the Hamiltonian formalism and why this is necessary. Examples from Einstein gravity and Yang-Mills gauge…

High Energy Physics - Theory · Physics 2009-10-30 Vladimir O. Soloviev

We provide characterizations of continuous eigenvalues for minimal symbolic dynamical systems described by $S$-adic structures satisfying natural mild conditions, such as recognizability and primitiveness. Under the additional assumptions…

Dynamical Systems · Mathematics 2026-02-05 Valérie Berthé , Paulina Cecchi-Bernales , Bastián Espinoza

We present a unified rule format for structural operational semantics with terms as labels that guarantees that the associated labelled transition system has some bounded-nondeterminism property. The properties we consider include finite…

Logic in Computer Science · Computer Science 2024-02-06 Luca Aceto , Ignacio Fábregas , Álvaro García-Pérez , Anna Ingólfsdóttir

Nonhamiltonian interaction of hamiltonian systems is considered. Dynamical equations are constructed by use of symmetric designs on Lie algebras. The results of analysis of these equations show that some class of symmetric designs on Lie…

High Energy Physics - Theory · Physics 2007-05-23 Denis V. Juriev

The decimal expansion real numbers, familiar to us all, has a dramatic generalization to representation of dynamical system orbits by symbolic sequences. The natural way to associate a symbolic sequence with an orbit is to track its history…

Dynamical Systems · Mathematics 2016-09-06 Roy Adler

Moving from the mathematical theory of (abstract) syntax, we develop a general relational theory of symbolic manipulation parametric with respect to, and accounting for, general notions of syntax. We model syntax relying on categorical…

Logic in Computer Science · Computer Science 2023-05-04 Francesco Gavazzo

Numerical simulations on Ising Spin Glasses show that spin glass transitions do not obey the usual universality rules which hold at canonical second order transitions. On the other hand the dynamics at the approach to the transition appear…

Disordered Systems and Neural Networks · Physics 2015-06-25 L. W. Bernardi , N. Lemke , P. O. Mari , I. A. Campbell , A. Alegria , J. Colmenero

Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of the rationals from a dynamical systems point of view, somehow continuing along the path started in [BI]. We obtain in…

Dynamical Systems · Mathematics 2026-04-10 Stefano Isola , Francesco Marchionni

We study the dynamics of renormalisation of an interval exchange transformation which features exact scaling (the cubic Arnoux-Yoccoz model). Using a symbolic space that describes both dynamics and scaling, we characterize the periodic…

Dynamical Systems · Mathematics 2007-05-23 J. H. Lowenstein , F. Vivaldi

With a nilpotent element in a semisimple Lie algebra g one associates a finitely generated associative algebra W called a W-algebra of finite type. This algebra is obtained from the universal enveloping algebra U(g) by a certain Hamiltonian…

Representation Theory · Mathematics 2010-06-03 Ivan Losev

We define a class of probabilistic models in terms of an operator algebra of stochastic processes, and a representation for this class in terms of stochastic parameterized grammars. A syntactic specification of a grammar is mapped to…

Artificial Intelligence · Computer Science 2007-05-23 Eric Mjolsness
‹ Prev 1 3 4 5 6 7 10 Next ›