Results 61 to 70 of about 125,672 (183)
Distributive and Dual Distributive Elements in Hyperlattices
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
Non‐amenability of mapping class groups of infinite‐type surfaces and graphs
Abstract This paper completely determines the non‐amenability of the mapping class groups of infinite‐type surfaces, the mapping class groups of locally finite infinite graphs of higher ranks, gives an example of non‐amenable stabiliser of a point at infinity of a coarsely bounded generated hyperbolic Polish group, and exhibits a class of mapping class
Yusen Long
wiley +1 more source
Associative triples and homomorphisms between travel groupoids on finite geodetic graphs [PDF]
Sergiy Kozerenko, Yur-Liubomysl Dekhtiar
doaj +1 more source
A genuine G$G$‐spectrum for the cut‐and‐paste K$K$‐theory of G$G$‐manifolds
Abstract Recent work has applied scissors congruence K$K$‐theory to study classical cut‐and‐paste (SK$SK$) invariants of manifolds. This paper proves the conjecture that the squares K$K$‐theory of equivariant SK$SK$‐manifolds arises as the fixed points of a genuine G$G$‐spectrum.
Maxine E. Calle, David Chan
wiley +1 more source
e-Subalgebras and e-Homomorphisms of PGK2-Algebras
This 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
Message authentication algorithm based on fully homomorphism MAC method
There are many problems of security and authentication in communication channel with data transmission. After studying the fully homomorphism encryption and message authentication code(MAC) algorithm, this paper presents a scheme of message ...
Pan Zhao, Zhang Yuejun, Ding Dailu
doaj +1 more source
Presentations of the braid group of the complex reflection group G(d,d,n)$G(d,d,n)$
Abstract We show that the braid group associated to the complex reflection group G(d,d,n)$G(d,d,n)$ is an index d$d$ subgroup of the braid group of the orbifold quotient of the complex numbers by a cyclic group of order d$d$. We also give a compatible presentation of G(d,d,n)$G(d,d,n)$ and its braid group for each tagged triangulation of the disk with ...
Francesca Fedele, Bethany Rose Marsh
wiley +1 more source
Homomorphic Preimages of Geometric Cycles
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core
Noncommutative polygonal cluster algebras
Abstract We define a new family of noncommutative generalizations of cluster algebras called polygonal cluster algebras. These algebras generalize the noncommutative surfaces of Berenstein–Retakh, and are inspired by the emerging theory of Θ$\Theta$‐positivity for the groups Spin(p,q)$\mathrm{Spin}(p,q)$.
Zachary Greenberg +3 more
wiley +1 more source
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
For digraphs $G$ and $H$, a homomorphism of $G$ to $H$ is a mapping $f:\ V(G)\dom V(H)$ such that $uv\in A(G)$ implies $f(u)f(v)\in A(H)$. If, moreover, each vertex $u \in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of a ...
Gupta, A. +4 more
core +2 more sources

