Results 41 to 50 of about 298 (187)
EVERY GROUP IS A MAXIMAL SUBGROUP OF THE FREE IDEMPOTENT GENERATED SEMIGROUP OVER A BAND [PDF]
Given an arbitrary group G we construct a semigroup of idempotents (band) BGwith the property that the free idempotent generated semigroup over BGhas a maximal subgroup isomorphic to G. If G is finitely presented then BGis finite. This answers several questions from recent papers in the area.
Igor Dolinka, Nik Ruskuc
openaire +5 more sources
On diagram groups over Fibonacci-like semigroup presentations and their generalizations [PDF]
We answer the question by Matt Brin on the structure of diagram groups over semigroup presentation ${\mathcal P}=\langle a,b,c\mid a=bc,b=ca,c=ab\rangle$. In the talk on Oberwolfach workshop, Brin conjectured that the diagram group over $\mathcal P$ with base $a$ is isomorphic to the generalized Thompson's group $F_9$.
openaire +3 more sources
Maximum number of zeroes of polynomials on weighted projective spaces over a finite field
Abstract We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to 1. This solves a conjecture by Aubry, Castryck, Ghorpade, Lachaud, O'Sullivan and Ram, which stated that a Serre‐like bound holds with equality for weighted
Jade Nardi, Rodrigo San‐José
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
Isotopy and equivalence of knots in 3‐manifolds
Abstract Two knots K$K$ and J$J$ in S3$S^3$ are isotopic if and only if they are related by an orientation‐preserving diffeomorphism of S3$S^3$. This claim follows from the fact that any orientation‐preserving self‐diffeomorphism of S3$S^3$ is isotopic to the identity. We show that this same idea applies to any prime oriented closed 3‐manifold.
Paolo Aceto +4 more
wiley +1 more source
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
A priori bounds for the generalised parabolic Anderson model
Abstract We show a priori bounds for solutions to (∂t−Δ)u=σ(u)ξ$(\partial _t - \Delta) u = \sigma (u) \xi$ in finite volume in the framework of Hairer's Regularity Structures [Invent Math 198:269–504, 2014]. We assume σ∈Cb2(R)$\sigma \in C_b^2 (\mathbb {R})$ and that ξ$\xi$ is of negative Hölder regularity of order −1−κ$- 1 - \kappa$ where κ<κ¯$\kappa <
Ajay Chandra +2 more
wiley +1 more source
Over the past 25 years, I have been immersed in research in Algebra and more particularly in ring theory. I embarked on writing this book on Smarandache rings (Srings) specially to motivate both ring theorists and Smarandache algebraists to develop and ...
Vasantha, Kandasamy
core +1 more source
Stochastic Dynamics From Maximum Entropy in Action Space
ABSTRACT We develop an information‐theoretic formulation of stochastic dynamics in which the fundamental stochastic variable is the total action connecting spacetime points, rather than individual paths. By maximizing Shannon entropy over a joint distribution of actions and endpoints, subject to normalization and a constraint on the mean action, we ...
Fabricio Souza Luiz +3 more
wiley +1 more source

