Related papers: *-Continuous Kleene $\omega$-Algebras for Energy P…
We develop and exposit some general algebra useful for working with certain algebraic structures that arise in stable homotopy theory, such as those encoding well-behaved theories of power operations for $\mathbb{E}_\infty$ ring spectra. In…
This paper addresses some fundamental issues in nonconvex analysis. By using pure complementary energy principle proposed by the author, a class of fully nonlinear partial diforerential equations in nonlinear elasticity is able to converted…
Power systems modeling and planning has long leveraged mathematical programming for its ability to provide optimality and feasibility guarantees. One feature that has been recognized in the optimization literature since the 1970s is the…
We consider an extension of logic programs, called \omega-programs, that can be used to define predicates over infinite lists. \omega-programs allow us to specify properties of the infinite behavior of reactive systems and, in general,…
Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lock-step. We provide a countermodel witnessing that the…
We study Hecke algebras of groups acting on trees with respect to geometrically defined subgroups. In particular, we consider Hecke algebras of groups of automorphisms of locally finite trees with respect to vertex and edge stabilizers and…
Cosmological scaling solutions, which give rise to a scalar-field density proportional to a background fluid density during radiation and matter eras, are attractive to alleviate the energy scale problem of dark energy. In the presence of…
In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on…
We obtain the symmetry algebra of multi-matrix models in the planar large N limit. We use this algebra to associate these matrix models with quantum spin chains. In particular, certain multi-matrix models are exactly solved by using known…
Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…
We construct and study an algebraic theory which closely approximates the theory of power operations for Morava E-theory, extending previous work of Charles Rezk in a way that takes completions into account. These algebraic structures are…
One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this…
One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research…
This paper shows how the use of Structural Operational Semantics (SOS) in the style popularized by the process-algebra community can lead to a more succinct and useful construction for building finite automata from regular expressions. Such…
We survey the model theoretic approach to a variety of ultrapower embedding problems in operator algebras.
In this paper, we investigate the energy problem in general relativity using approximate Lie symmetry methods for differential equations. This procedure is applied to Bardeen model (the regular black hole solution). Here we are forced to…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…
We discuss the deal of imperfectness of atomic actions in reality with the background of process algebras. And we show the applications of the imperfect actions in verification of computational systems.
We propose a new dark energy model for solving the cosmological fine-tuning and coincidence problems. A default assumption is that the fine-tuning problem disappears if we do not interpret dark energy as vacuum energy. The key idea to…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…