Results 31 to 40 of about 6,505,496 (165)
Abstract Background Personalized neoantigen vaccine design for glioma requires the integration of mutation‐derived peptide evidence, molecular properties, HLA coverage and finite manufacturing capacity. TAMAVAQ/Q‐TAMAVAQ combines quantum‐geometric descriptor representation with graph transport and auditable peptide‐panel assembly.
Ioannis Grigoriadis
wiley +1 more source
Every group is a maximal subgroup of a naturally occurring free idempotent generated semigroup [PDF]
Gray and Ruskuc have shown that any group G occurs as the maximal subgroup of some free idempotent generated semigroup IG(E) on a biordered set of idempotents E, thus resolving a long standing open question. Given the group G, they make a careful choice for E and use a certain amount of well developed machinery.
Gould, Victoria, Yang, Dandan
openaire +3 more sources
Generic complexity of solving of equations in finite groups, semigroups and fields
Abstract The paper is devoted by investigation of generic complexity of the algorithmic problem of solving of systems of equations in finite groups, finite semigroups and finite fields. We show that if this problem is intractable in the worst case and P = BPP, then there is no polynomial strongly generic algorithm, which solves it.
Alexander Rybalov, Artem Shevlyakov
openaire +1 more source
ABSTRACT Recent results have shown that domain‐uniform stabilizability and detectability imply spatial exponential decay of perturbations in optimally controlled hyperbolic PDEs on one‐dimensional domains. This domain‐uniform stabilizability and detectability can be achieved only if the control domain is distributed over the whole spatial domain such ...
Benedikt Oppeneiger
wiley +1 more source
Molaie’s generalized groups are completely simple semigroups [PDF]
In [2] Molaei introduces generalized groups, a class of algebras of interest to physics, and proves some results about them. The aim of this note is to prove that Generalized Groups are the Completely Simple Semigroups.
Araújo, João, Konieczny, Janusz
core +1 more source
Classification and enumeration of finite semigroups [PDF]
The classification of finite semigroups is difficult even for small orders because of their large number. Most finite semigroups are nilpotent of nilpotency rank 3.
Distler, Andreas
core +2 more sources
Generalized Polynomials on Semigroups
This article has two main parts. In the first part we show that some of the basic theory of generalized polynomials on commutative semi-groups can be extended to all semigroups.
Ebanks Bruce
doaj +1 more source
Partial Observation of Linear Systems With the Mori–Zwanzig Formalism
ABSTRACT The Mori–Zwanzig (MZ) formalism provides a systematic framework for deriving reduced‐order model of dynamical systems when only part of the state is observed, but its practical use is often limited by the complexity of the resulting computations.
Fan Wang, Peter Benner, Jan Heiland
wiley +1 more source
Unary FA-presentable semigroups [PDF]
Automatic presentations, also called FA-presentations, were introduced to extend nite model theory to innite structures whilst retaining the solubility of interesting decision problems.
Cain, Alan James +3 more
core +1 more source
Context‐free graphs and their transition groups
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source

