Results 51 to 60 of about 7,960 (211)
Families of singular algebraic varieties that are rationally elliptic spaces
Mathematische Nachrichten, Volume 299, Issue 1, Page 214-223, January 2026.Abstract We discuss families of hypersurfaces with isolated singularities in projective space with the property that the sum of the ranks of the rational homotopy and the homology groups is finite. They represent infinitely many distinct homotopy types with all hypersurfaces having a nef canonical or anti‐canonical class.
A. Libgober
wiley +1 more source
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Discussiones Mathematicae Graph Theory, 2014 In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Sen Sagnik
doaj +1 more source
On the universal regular homomorphism in codimension
, 2021 Bruno Kahn
openalex +1 more source
Lattices of homomorphisms [PDF]
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1986 AbstractGiven a variety K of lattice-ordered algebras, A ∈ K is catalytic if for all B ∈ K, K(A, B) is a lattice for the pointwise order. The catalytic objects are determined for various varieties of distributive-lattice-ordered algebras. The characterisations obtained do not show an overall unity and exhibit diverse behaviour.
Davey, B, Priestley, H
openaire +3 more sources
Random Structures &Algorithms, Volume 68, Issue 1, January 2026.ABSTRACT We study a random walk on the Lie algebra sl2(Fp)$$ {\mathfrak{sl}}_2\left({\mathbf{F}}_p\right) $$ where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we analyze the limiting distribution of the random walk and the speed at which it
Urban Jezernik, Matevž Miščič
wiley +1 more source
On r-Ideals and m-k-Ideals in BN-Algebras
Axioms, 2022 A BN-algebra is a non-empty set X with a binary operation “∗” and a constant 0 that satisfies the following axioms: (B1) x∗x=0, (B2) x∗0=x, and (BN) (x∗y)∗z=(0∗z)∗(y∗x) for all x, y, z ∈X.
Sri Gemawati +4 more
doaj +1 more source
An Algorithm for the Numbers of Homomorphisms from Paths to Rectangular Grid Graphs [PDF]
, 2023 Hatairat Yingtaweesittikul +2 more
openalex +1 more source
Counting Independent Sets in Percolated Graphs via the Ising Model
Random Structures &Algorithms, Volume 68, Issue 1, January 2026.ABSTRACT Given a graph G$$ G $$, we form a random subgraph Gp$$ {G}_p $$ by including each edge of G$$ G $$ independently with probability p$$ p $$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite graphs satisfying certain vertex‐isoperimetric properties, extending the work of ...
Anna Geisler +3 more
wiley +1 more source
Hyers-Ulam-Rassias stability of Jordan homomorphisms on Banach algebras
Journal of Inequalities and Applications, 2005 We prove that a Jordan homomorphism from a Banach algebra into a semisimple commutative Banach algebra is a ring homomorphism. Using a signum effectively, we can give a simple proof of the Hyers-Ulam-Rassias stability of a Jordan homomorphism between ...
Hirasawa Go +2 more
doaj
Splitting the difference: Computations of the Reynolds operator in classical invariant theory
Bulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.Abstract If G$G$ is a linearly reductive group acting rationally on a polynomial ring S$S$, then the inclusion SG↪S$S^{G} \hookrightarrow S$ possesses a unique G$G$‐equivariant splitting, called the Reynolds operator. We describe algorithms for computing the Reynolds operator for the classical actions as in Weyl's book.
Aryaman Maithani
wiley +1 more source