Results 231 to 240 of about 153,244 (275)
Some of the next articles are maybe not open access.

Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures

2022
Functional Commitments (FC) allow one to reveal functions of committed data in a succinct and verifiable way. In this paper we put forward the notion of additive-homomorphic FC and show two efficient, pairing-based, realizations of this primitive supporting multivariate polynomials of constant degree and monotone span programs, respectively.
Dario Catalano, Dario Fiore, Ida Tucker
openaire   +2 more sources

Homomorphisms of Signed Graphs [PDF]

open access: possibleJournal of Graph Theory, 2014
AbstractA signed graph is a graph G together with an assignment of signs + and − to all the edges of G where Σ is the set of negative edges. Furthermore and are considered to be equivalent if the symmetric difference of Σ1 and Σ2 is an edge cut of G. Naturally arising from matroid theory, several notions of graph theory, such as the theory of minors
Naserasr, Reza   +2 more
openaire   +2 more sources

Isolated spectral points and Koliha-Drazin invertible elements in quotient Banach algebras and homomorphism ranges

Mathematical Proceedings of the Royal Irish Academy, 2014
In this article poles, isolated spectral points, group, Drazin and Koliha-Drazin invertible elements in the context of quotient Banach algebras or in ranges of (not necessarily continuous) homomorphism between complex unital Banach algebras will be ...
Enrico Boasso
semanticscholar   +1 more source

Recent developments of the conditional stability of the homomorphism equation

, 2015
The issue of Ulam’s type stability of an equation is understood in the following way: when a mapping which satisfies the equation approximately (in some sense), it is “close” to a solution of it.
J. Brzdȩk   +3 more
semanticscholar   +1 more source

Homomorphism polynomials complete for VP

Electron. Colloquium Comput. Complex., 2014
The VP versus VNP question, introduced by Valiant, is probably the most important open question in algebraic complexity theory. Thanks to completeness results, a variant of this question, VBP versus VNP, can be succinctly restated as asking whether the ...
Arnaud Durand   +4 more
semanticscholar   +1 more source

Graph Homomorphism Features: Why Not Sample?

PKDD/ECML Workshops, 2021
P. Beaujean, F. Sikora, F. Yger
semanticscholar   +1 more source

A Frobenius homomorphism for Lusztig's quantum groups over arbitrary roots of unity

, 2014
For a finite dimensional semisimple Lie algebra and a root of unity, Lusztig defined an infinite dimensional quantum group of divided powers. Under certain restrictions on the order of the root of unity, he constructed a Frobenius homomorphism with ...
S. Lentner
semanticscholar   +1 more source

Independence and graph homomorphisms graph homomorphisms

Journal of Graph Theory, 1993
AbstractA graph with n vertices that contains no triangle and no 5‐cycle and minimum degree exceeding n/4 contains an independent set with at least (3n)/7 vertices. This is best possible. The proof proceeds by producing a homomorphism to the 7‐cycle and invoking the No Homomorphism Lemma.
Michael O. Albertson   +2 more
openaire   +2 more sources

Homomorphisms and promotability

1989
The construction of structure-preserving maps, or “homomorphisms,” is described for an arbitrary data type: examples of these functions are given for list- and tree-like structures and types defined by mutual induction. From the definition of a data type it is also possible to infer a “promotion” theorem for proving equalities of homomorphisms.
openaire   +3 more sources

Symplectic reflection algebras, Calogero-Moser space, and deformed Harish-Chandra homomorphism

, 2000
.To any finite group Γ⊂Sp(V) of automorphisms of a symplectic vector space V we associate a new multi-parameter deformation, Hκ of the algebra ℂ[V]#Γ, smash product of Γ with the polynomial algebra on V.
P. Etingof, V. Ginzburg
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy