Related papers: *-Continuous Kleene $\omega$-Algebras for Energy P…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…
In higher dimensional gauge theory, we need energies with higher power terms of field strength in order to realize point-wise monopoles. We consider new models with higher power terms of field strength and extraordinary kinetic term of…
This study focuses on edge computing in dense millimeter wave vehicle-to-everything (V2X) networks. A control problem is formulated to minimize the energy consumption under delay constraint resulting from vehicle mobility. A tractable…
A quantum integrable spin chain model associated with the $G_2$ exceptional Lie algebra is studied. By using the fusion technique, the closed recursive relations among the fused transfer matrices are obtained. These identities allow us to…
We study existence of nontrivial solutions to problem \begin{equation*} \left\lbrace \begin{array}{rcll} -\Delta u &=& \lambda u+f(u)&\text{ in }\Omega,\\ u&=&0&\text{ on }\partial \Omega, \end{array}\right. \end{equation*} where $\Omega…
In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^{\omega +…
We introduce infinitary action logic with exponentiation -- that is, the multiplicative-additive Lambek calculus extended with Kleene star and with a family of subexponential modalities, which allows some of the structural rules…
We propose dynamical systems defined on algebra of lattices, which we call `lattice equations'. We give exact general solutions of initial value problems for a class of lattice equations, and evaluate the complexity of the solutions.…
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…
This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization…
This Ph.D. thesis contains original contributions to several areas within the disciplines of disordered systems, numerical linear algebra, and scientific computing: (1) Theoretical and numerical study of the errors caused by using certain…
Maxmin-$\omega$ dynamical systems were previously introduced as an ``all-in-one package'' that can yield a solely min-plus, a solely max-plus, or a max-min-plus dynamical system by varying a parameter $\omega\in(0,1]$. With such systems in…
This paper deals with the lack of compactness in nonlinear elliptic problems $(P)$. In particular, a domain $\Omega$ is provided where not converging Palais-Smale sequences exist at every energy level. Nevertheless, it is proved that…
We show how several important classical problems, with positive definite potential energy, can be solved by starting from the factorization of the total mechanical energy using complex numbers. In particular, we derive in a new way exact…
We study numerically the ODE/IM correspondence for untwisted affine Lie algebras associated with simple Lie algebras including exceptional type. We consider the linear problem obtained from the massless limit of that of the modified affine…
First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous…
We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras.…
We analyze an autonomous micro-engine as a closed quantum mechanical system, including the work it performs and the fuel it consumes. Our model system shows by example that it is possible to transfer energy steadily and spontaneously…
We prove that the equational theory of Kleene algebra with commutativity conditions on primitives (or atomic terms) is undecidable, thereby settling a longstanding open question in the theory of Kleene algebra. While this question has also…