相关论文: Algebraic Elimination of epsilon-transitions

A version of the Dirac equation is derived from first principles using a combination of quaternions and multivariate 4-vectors. The nilpotent form of the operators used allows us to derive explicit expressions for the wavefunctions of free…

Different analogs of quasiclassical limit for a q-oscillator which result in different (commutative and non-commutative) algebras of ``classical'' observables are derived. In particular, this gives the q-deformed Poisson brackets in terms…

We prove the existence of a unitary transformation that enables two arbitrarily given Hamiltonians in the same Hilbert space to be transformed into one another. The result is straightforward yet, for example, it lays the foundation to…

We consider a family of cellular automata $\Phi(n,k)$ associated with infinite reduced elements on the affine symmetric group $\hat S_n$, which is a tropicalization of the rational maps introduced by two of the authors. We study the soliton…

The earlier work of the first and the third named authors introduced the algebra $\mathbb{A}_{q,t}$ and its polynomial representation. In this paper we construct an action of this algebra on the equivariant K-theory of certain smooth strata…

We have constructed a Heisenberg-type algebra generated by the Hamiltonian, the step operators and an auxiliar operator. This algebra describes quantum systems having eigenvalues of the Hamiltonian depending on the eigenvalues of the two…

We introduce notions of simulation between semiring-weighted automata as models of quantitative systems. Our simulations are instances of the categorical/coalgebraic notions previously studied by Hasuo---hence soundness against language…

Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…

We discuss the possibility of defining an algebraic dynamics within the settings of $O^\star$-algebras. Compared with our previous results on this subject, the main improvement here is that we are not assuming the existence of some…

Krohn-Rhodes theory encompasses the techniques for the study of finite automata and their decomposition into elementary automata. The famous result of Krohn and Rhodes roughly states that each finite automaton can be decomposed into…

We consider a hierarchy of the natural type Hamiltonian systems of $n$ degrees of freedom with polynomial potentials separable in general ellipsoidal and general paraboloidal coordinates. We give a Lax representation in terms of $2\times 2$…

$\Omega$-automata and Wilke algebras are formalisms for characterising $\omega$-regular languages via their ultimately periodic words. $\Omega$-automata read finite representations of ultimately periodic words, called lassos, and they are a…

There is a fundamental difficulty in generalizing weighted automata to the case of infinite words: in general the infinite sum-of-products from which the weight of a given word is derived will diverge. Many solutions to this problem have…

The generating function for elements of the Bethe subalgebra of Hecke algebra is constructed as Sklyanin's transfer-matrix operator for Hecke chain. We show that in a special classical limit q -> 1 the Hamiltonians of the Gaudin model can…

It is proposed the scheme of quantum mechanics, in which a Hilbert space and the linear operators are not primary elements of the theory. Instead of it certain variant of the algebraic approach is considered. The elements of noncommutative…

By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout that proof, manual procedures are used where automated ones…

We analyze the consistency of the ADM approach to KK model; we prove that KK reduction commute with ADM splitting. This leads to a well defined Hamiltonian; we provide the outcome. The electromagnetic constraint is derived from a…

This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers. We use polynomial identity testing and the Isolation Lemma to obtain…

We use the notion of a partial action of a monoid to introduce a generalization of automata, which we call "a preautomaton". We study properties of preautomata and of languages recognized by preautomata.

We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams…