Results 61 to 70 of about 2,016 (201)
On computing local monodromy and the numerical local irreducible decomposition
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
e-Subalgebras and e-Homomorphisms of PGK2-Algebras
Journal of MathematicsThis paper is devoted for three main purposes. First, subalgebras, e-subalgebras of a principal generalized K2-algebra (PGK2-algebra), and their associated principal generalized K2-triples are studied. We prove that every GM-subalgebra, GK-subalgebra, De
Abd El-Mohsen Badawy +3 more
doaj +1 more source
Homomorphism–homogeneous graphs [PDF]
Journal of Graph Theory, 2010 AbstractWe answer two open questions posed by Cameron and Nesetril concerning homomorphism–homogeneous graphs. In particular we show, by giving a characterization of these graphs, that extendability to monomorphism or to homomorphism leads to the same class of graphs when defining homomorphism–homogeneity.
Momchil Rusinov, Pascal Schweitzer
openaire +3 more sources
On the additive image of zeroth persistent homology
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
Homomorphisms and amalgamation
Discrete Mathematics, 2003 A graph \(G\) is called core if each homomorphism \(G \to G\) is an automorphism of \(G\). A graph \(H\) is called \(G\)-colourable if there is a homomorphism \(H \to G\). The author proves that if \(G\) is a finite core, then the class of \(G\)-colourable graphs is a pseudo-amalgamation class in the sense of \textit{R.
openaire +2 more sources
On the automorphisms of the power semigroups of a numerical semigroup
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley +1 more source
Distributive and Dual Distributive Elements in Hyperlattices
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017 In this paper we introduce and study distributive elements, dual distributive elements in hyperlattices, and prove that these elements forms ∧-semi lattice and ∨-semi hyperlattice, respectively.
Ameri Reza +3 more
doaj +1 more source
Associative triples and homomorphisms between travel groupoids on finite geodetic graphs [PDF]
Discrete Mathematics LettersSergiy Kozerenko, Yur-Liubomysl Dekhtiar
doaj +1 more source
Context‐free graphs and their transition groups
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.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
Journal of Combinatorial Theory, Series B, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Laura Mancinska, David E. Roberson
openaire +2 more sources