Related papers: A note on the stabilizer formalism via noncommutat…
We show that if a flat group scheme acts properly, with finite stabilizers, on an algebraic space, then a quotient exists as a separated algebraic space. More generally we show any flat groupid for which the family of stabilizers is finite…
The classical Lagrange formalism is generalized to the case of arbitrary stationary (but not necessarily conservative) dynamical systems. It is shown that the equations of motion for such systems can be derived in the standard ways from the…
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite…
We prove the existence of nonradial classical solutions to the 2D incompressible Euler equations with compact support. More precisely, for any positive integer $k$, we construct compactly supported stationary Euler flows of class…
Signal analysis is built upon various resolutions of the identity in signal vector spaces, e.g. Fourier, Gabor, wavelets, etc. Similar resolutions are used as quantizers of functions or distributions, paving the way to a time-frequency or…
Let $E$ and $F$ be Hilbert $C^*$-modules over a $C^*$-algebra $\CAlg{A}$. New classes of (possibly unbounded) operators $t:E\to F$ are introduced and investigated. Instead of the density of the domain $\Def(t)$ we only assume that $t$ is…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class C, and using a first-order formula {\phi}…
We study the stabilized automorphism group of minimal and, more generally, certain transitive dynamical systems. Our approach involves developing new algebraic tools to extract information about the rational eigenvalues of these systems…
In this work, we introduce a new notion for representing graph classes with formal languages. In contrast to the seminal work by Kitaev and Pyatkin to represent graphs by words, we use formal binary languages in order to have a set of…
We introduce unbounded strongly irreducible operators and transitive operators. These operators are related to a certain class of indecomposable Hilbert representations of quivers on infinite-dimensional Hilbert spaces. We regard the theory…
We consider a family of conforming space-time discretizations for the wave equation based on a first-order-in-time formulation employing maximal regularity splines. In contrast with second-order-in-time formulations, which require a CFL…
We investigate the kinetics of a nonrelativistic particle interacting with a constant external force on a Lie-algebraic noncommutative space. The structure constants of a Lie algebra, also called noncommutative parameters, are constrained…
We introduce a stabilizer formalism for EAQECCs with noise ebits, using special subgroups of product groups of two Pauli groups. This formalism includes the two coding schemes,given by Lai and Brun (C.Y. Lai and T. A. Brun, PHYSICAL REVIEW…
This article, addressed to a general audience of functional analysts, is intended to be an illustration of a few basic principles from `noncommutative functional analysis', more specifically the new field of {\em operator spaces.} In our…
Dickson's commutative semifields are an important class of finite division algebras. We generalise Dickson's construction of commutative division algebras by doubling both finite field extensions and central simple algebras and not…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
This paper provides a description of an algebraic setting for the Lagrangian formalism over graded algebras and is intended as the necessary first step towards the noncommutative C-spectral sequence (variational bicomplex). A noncommutative…