Results 71 to 80 of about 14,027 (232)

Homomorphic Preimages of Geometric Paths

open access: yesDiscussiones Mathematicae Graph Theory, 2018
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism f : G → H. A geometric graph Ḡ is a simple graph G together with a straight line drawing of G in the plane with the vertices in
Cockburn Sally
doaj   +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

Phong‐Rodrigues Extrinsic Vector‐Field Processing

open access: yesComputer Graphics Forum, EarlyView.
Abstract We introduce a new extrinsic discretization of tangent vector fields on triangle meshes that is continuous, with bounded derivatives that are continuous almost everywhere, supporting pointwise evaluation and integration of differential operators.
Hongyi Liu   +4 more
wiley   +1 more source

Hyers-Ulam-Rassias stability of Jordan homomorphisms on Banach algebras

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

Algorithms for determining the type of algebraic hyperstructures and morphisms [PDF]

open access: yesMathematics and Computational Sciences
In this paper, we present some primary methods to define a hypergroupoid by algorithm. Then, we present algorithms for checking if it is closed under ο, associativity, weak associativity, commutativity, weak commutativity, establishing the reproduction ...
Aboutorab Pourhaghani   +2 more
doaj   +1 more source

Inference‐Sufficient Representations for High‐Throughput Measurement: Lessons from Lossless Compression Benchmarks in 4D‐STEM

open access: yesAdvanced Computing, Volume 1, Issue 1, December 2026.
Agentic workflows will need a principled account of how data relates to scientific inference. We benchmark thirteen off‐the‐shelf compression implementations; the best already sits within 2.5×$\times$ of the entropy bound. We propose inference‐sufficient representations: model‐based representation, employing abductive inference, can reduce storage a ...
Ondrej Dyck   +5 more
wiley   +1 more source

The Characterization of a Lattice Homomorphism

open access: yes, 1975
We shall give a simple characterization of a lattice homomorphism from a linear lattice E to a linear lattice F. This paper is motivated by the following two theorems in Kaplan [2] :If ϕ is a lattice homomorphism, then ϕt(Fb) is an ideal in Eb.(2) If ϕ ...
Jongsik Kim
core   +1 more source

Chromatic Ramsey Numbers and Two‐Color Turán Densities

open access: yesJournal of Graph Theory, Volume 113, Issue 4, Page 663-676, December 2026.
ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley   +1 more source

Random Turán Problems for Hypergraph Expansions

open access: yesRandom Structures &Algorithms, Volume 69, Issue 4, December 2026.
ABSTRACT Given an r0$$ {r}_0 $$‐uniform hypergraph F$$ F $$, we define its r$$ r $$‐uniform expansion F(r)$$ {F}^{(r)} $$ to be the hypergraph obtained from F$$ F $$ by inserting r−r0$$ r-{r}_0 $$ distinct vertices into each edge of F$$ F $$, and we define ex(Gn,pr,F(r))$$ \mathrm{ex}\left({G}_{n,p}^r,{F}^{(r)}\right) $$ to be the largest F(r)$$ {F ...
Jiaxi Nie, Sam Spiro
wiley   +1 more source

Homomorphism–homogeneous graphs [PDF]

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

Home - About - Disclaimer - Privacy