Results 41 to 50 of about 11,002 (236)
Homomorphism Tensors and Linear Equations [PDF]
, 2021 Lovász (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e.
Rattan, Gaurav +4 more
core +1 more source
Compact Manifolds With Unbounded Nilpotent Fundamental Groups and Positive Ricci Curvature
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT It follows from the work of Kapovitch and Wilking that a closed manifold with nonnegative Ricci curvature has a uniformly almost nilpotent fundamental group. Leftover questions and conjectures, have asked if in this context the fundamental group is actually uniformly almost abelian. The main goal of this work is to construct examples (Mk9,gk)$(
Elia Bruè, Aaron Naber, Daniele Semola
wiley +1 more source
The Complexity of Homomorphism Reconstructibility [PDF]
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where one would like
Seppelt, Tim +7 more
core +2 more sources
Stability of -Jordan Homomorphisms from a Normed Algebra to a Banach Algebra
Abstract and Applied Analysis, 2013 We establish the hyperstability of -Jordan homomorphisms from a normed algebra to a Banach algebra, and also we show that an -Jordan homomorphism between two commutative Banach algebras is an -ring homomorphism.
Yang-Hi Lee
doaj +1 more source
Procedia Computer Science, 2013 AbstractThe study of homomorphic encryption techniques has led to significant advancements in the computing domain, particularly in the sphere of cloud computing. Homomorphic encryption provides a means for securely transmitting and storing confidential information across and in a computer system.
Monique Ogburn +2 more
openaire +2 more sources
Homomorphism Tensors and Linear Equations [PDF]
, 2022 Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e.
Rattan, Gaurav +3 more
core +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.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
Barekeng, 2013 These notes in this paper will discuss about C*-algebras commutative and its properties. The theory of algebra-*, Banach-* algebra, C*-algebras and *-homomorphism are included. We also give some examples of commutative C*-algebras.
Harmanus Batkunde
doaj +1 more source
Explicit 3‐colorings for Exponential Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento +2 more
wiley +1 more source
On generalized derivations as homomorphisms and anti-homomorphisms
Glasnik matematički, 2004 The concept of derivations as well as generalized derivations (i.e. Ia,b(x) = ax + xb, for all a,b R) have been generalized as an additive function F : R R satisfying F(xy) = F(x)y + xd(y) for all x,y R, where d is a nonzero derivation on R. Such a function F is said to be a generalized derivation.
openaire +4 more sources