Results 31 to 40 of about 22,097 (141)
The Index of (White) Noises and their Product Systems
(See detailed abstract in the article.) We single out the correct class of spatial product systems (and the spatial endomorphism semigroups with which the product systems are associated) that allows the most far reaching analogy in their classifiaction ...
Arveson W. +16 more
core +1 more source
Growth problems in diagram categories
Abstract In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
Jonathan Gruber, Daniel Tubbenhauer
wiley +1 more source
Automorphisms of Curves and Weierstrass semigroups for Harbater-Katz-Gabber covers [PDF]
We study $p$-group Galois covers $X \rightarrow \mathbb{P}^1$ with only one fully ramified point. These covers are important because of the Katz-Gabber compactification of Galois actions on complete local rings.
Karanikolopoulos, Sotiris +1 more
core
Markov semigroups, monoids, and groups
A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating set. This paper
Alan J. Cain +9 more
core +1 more source
Is every product system concrete?
Abstract Is every product system of Hilbert spaces over a semigroup P$P$ concrete, that is, isomorphic to the product system of an E0$E_0$‐semigroup over P$P$? The answer is no if P$P$ is discrete, cancellative and does not embed in a group. However, we show that the answer is yes for a reasonable class of semigroups.
S. Sundar
wiley +1 more source
Diffusion determines the recurrent graph [PDF]
We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism.
Keller, Matthias +3 more
core
Commuting Pairs in Quasigroups
ABSTRACT A quasigroup is a pair ( Q , ∗ ), where Q is a nonempty set and ∗ is a binary operation on Q such that for every ( a , b ) ∈ Q 2, there exists a unique ( x , y ) ∈ Q 2 such that a ∗ x = b = y ∗ a. Let ( Q , ∗ ) be a quasigroup. A pair ( x , y ) ∈ Q 2 is a commuting pair of ( Q , ∗ ) if x ∗ y = y ∗ x.
Jack Allsop, Ian M. Wanless
wiley +1 more source
Semigroups of $sl_3(\mathbb{C})$ tensor product invariants
We compute presentations for a family of semigroup algebras related to the problem of decomposing $sl_3(\mathbb{C})$ tensor products. Along the way we find new toric degenerations of the Grassmannian variety $Gr_3(\mathbb{C}^n)$ which $T-$invariant for ...
4ti2 team +14 more
core +1 more source
ABSTRACT We analyze nonlinear degenerate coupled partial differential equation (PDE)‐PDE and PDE‐ordinary differential equation (ODE) systems that arise, for example, in the modelling of biofilm growth. One of the equations, describing the evolution of a biomass density, exhibits degenerate and singular diffusion.
K. Mitra, S. Sonner
wiley +1 more source
Effective Theories for Circuits and Automata
ing an effective theory from a complicated process is central to the study of complexity. Even when the underlying mechanisms are understood, or at least measurable, the presence of dissipation and irreversibility in biological, computational and social ...
Calvin W. H. +9 more
core +1 more source

