Results 71 to 80 of about 152,483 (296)

Universal finitary codes with exponential tails

open access: yes, 2005
In 1977, Keane and Smorodinsky showed that there exists a finitary homomorphism from any finite-alphabet Bernoulli process to any other finite-alphabet Bernoulli process of strictly lower entropy.
Harvey, Nate   +3 more
core   +2 more sources

Bounded cohomology of groups acting on trees with almost prescribed local actions

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract We prove the vanishing of bounded cohomology of the groups acting on trees with almost prescribed local actions G(F,F′)$G(F, F^{\prime })$, where F
Giuseppe Bargagnati, Elena Bogliolo
wiley   +1 more source

Distributive and Dual Distributive Elements in Hyperlattices

open access: yesAnalele 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

Finite models for positive combinatorial and exponential algebra

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of non‐negative integers whose equational theory has no finite axiomatisation, and show this also holds if factorial, fixed base exponentiation and operations for binomial coefficients are adjoined.
Tumadhir Alsulami, Marcel Jackson
wiley   +1 more source

Factoring Continuous Homomorphisms Defined on Submonoids of Products of Topologized Monoids

open access: yesAxioms, 2019
We study factorization properties of continuous homomorphisms defined on submonoids of products of topologized monoids. We prove that if S is an ω-retractable submonoid of a product D = ∏ i ∈ I D i of topologized monoids ...
Mikhail Tkachenko
doaj   +1 more source

On skew derivations as homomorphisms or anti-homomorphisms [PDF]

open access: yesCommentationes Mathematicae Universitatis Carolinae, 2016
Let $R$ be a prime ring with center $Z$ and $I$ be a nonzero ideal of $R$. In this manuscript, we investigate the action of skew derivation $(\delta,\varphi)$ of $R$ which acts as a homomorphism or an anti-homomorphism on $I$. Moreover, we provide an example for semiprime case.
Shuliang Huang   +2 more
openaire   +2 more sources

Fundamental Homomorphism Theorems for Neutrosophic Extended Triplet Groups

open access: yesSymmetry, 2018
In classical group theory, homomorphism and isomorphism are significant to study the relation between two algebraic systems. Through this article, we propose neutro-homomorphism and neutro-isomorphism for the neutrosophic extended triplet group (NETG ...
Mehmet Çelik   +2 more
semanticscholar   +1 more source

The Tannakian Formalism and the Langlands Conjectures

open access: yes, 2010
Let H be a connected reductive group over an algebraically closed field of characteristic zero, and let G be an abstract group. In this note we show that every homomorphism from the Grothendieck semiring of H to that of G which maps irreducible ...
Chevalley   +5 more
core   +1 more source

Growth problems in diagram categories

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract In the semisimple case, we derive (asymptotic) formulas for the growth rate of the number of summands in tensor powers of the generating object in diagram/interpolation categories.
Jonathan Gruber, Daniel Tubbenhauer
wiley   +1 more source

Homomorphisms and amalgamation

open access: yesDiscrete 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   +3 more sources

Home - About - Disclaimer - Privacy