Results 91 to 100 of about 13,469,908 (217)
Signed Projective Cubes, a Homomorphism Point of View
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Homomorphism indistinguishability
Two graphs G and H are homomorphism indistinguishable over a class of graphs if, for all graphs F ∊ , the number of homomorphisms from F to G is equal to the number of homomorphisms from F to H.
Seppelt, Tim Frederik
core +1 more source
On Generalized Semiderivations of Prime Near Rings
Let N be a near ring. An additive mapping F:N→N is said to be a generalized semiderivation on N if there exists a semiderivation d:N→N associated with a function g:N→N such that F(xy)=F(x)y+g(x)d(y)=d(x)g(y)+xF(y) and F(g(x))=g(F(x)) for all x,y∈N.
Abdelkarim Boua +3 more
doaj +1 more source
A Linear Generalization of the Nearly Gorenstein Property, With Applications to Veronese Subalgebras
ABSTRACT We study the nearly Gorenstein property for Veronese subalgebras of (semi‐)standard graded algebras. We introduce a condition (♮)$(\natural)$ for Cohen–Macaulay semi‐standard graded rings, motivated by the study of Ehrhart rings. We show that if a semi‐standard graded algebra R$ R$ satisfies (♮)$(\natural)$, then its Veronese subalgebras R(k)$
Sora Miyashita
wiley +1 more source
Monotone Bounded-Depth Complexity of Homomorphism Polynomials
For every fixed graph H, it is known that homomorphism counts from H and colorful H-subgraph counts can be determined in O(n^{t+1}) time on n-vertex input graphs G, where t is the treewidth of H.
Dwivedi, Prateek ; id_orcid +3 more
core +1 more source
Isotopic Properties of Neutrosophic Soft Quasigroup and Its Application in Decision-making [PDF]
A Q-neutrosophic soft quasigroup (ϕ Q, A) represents a novel mathematical framework designed to address scenarios characterized by indeterminate occurrences.
Benard Osoba +6 more
doaj +1 more source
Amenability Constants for Unconditional Sums of Banach Algebras
ABSTRACT We study Johnson amenability for unconditional direct sums of Banach algebras. Given a family (Ai)i∈I$(A_i)_{i\in I}$ of Banach algebras and a Banach sequence lattice E$E$ on I$I$, the E$E$‐sum ⨁i∈IAiE${\bigl (\bigoplus _{i\in I} A_i\bigr)}_{\!E}$ carries a natural Banach algebra structure via coordinatewise multiplication.
Tomasz Kania, Jerzy Ka̧kol
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
On the Existential Theory of the Completions of a Global Field
ABSTRACT We discuss the common existential theory of all or almost all completions of a global function field.
Philip Dittmann, Arno Fehm
wiley +1 more source

