Results 61 to 70 of about 15,994,752 (138)
The homomorphism threshold of {C₃,C₅}-free graphs [PDF]
We determine the structure of {C₃,C₅}-free graphs graphs with n vertices and minimum degree larger than n/5: such graphs are homomorphic to the graph obtained from a (5k - 3)-cycle by adding all chords of length 1(mod 5), for some k .
Snyder, R, Letzter, S
core +1 more source
The Haagerup property is not invariant under quasi‐isometry
Abstract Using the work of Cornulier–Valette and Whyte (see Appendix A for the latter), we show that neither the Haagerup property nor weak amenability is invariant under quasi‐isometry of finitely generated groups. Appendix B shows, using the same examples, that the same holds for vanishing of the equivariant Lp$L^p$‐compression.
Mathieu Carette +4 more
wiley +1 more source
In this paper, we define the concept of Interval-Valued Intuitionistic Fuzzy Ternary Subhemiring ( IVIFTSHR) of a Hemiring and also in this note we discussed, some properties of image and pre-image of a level ternary subhemiring of IVIFTSHR with respect ...
N.Anitha , K.Tamilvanan
core +1 more source
Weighted veronese rings via convex semigroups
Abstract We determine several properties of two‐dimensional normal affine semigroup rings, and in particular of weighted Veronese rings, including determinantal presentations, Gröbner bases, graded Hilbert series and graded Betti numbers, the structure of their associated graded rings, and their Koszul property.
Bek Chase +6 more
wiley +1 more source
The Number of finite homomorphism-homogeneous tournaments with loops
A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Nešetřil introduced a relaxed version of homogeneity: we say that a
Mašulović Dragan
core
Johnson–Schwartzman gap labeling for metric and discrete decorated graphs
Abstract We study Schrödinger operators on metric and discrete decorated graphs. The values taken by the integrated density of states (IDS) on spectral gaps are called gap labels. A natural question is which gap labels can occur. We answer this for graphs arising from uniquely ergodic one‐dimensional dynamical systems by proving Johnson–Schwartzman gap‐
Ram Band, Gilad Sofer
wiley +1 more source
Maximal subsemigroups of infinite symmetric inverse monoids
Abstract The symmetric inverse monoid IX$I_X$ on a set X$X$ consists of all bijective functions whose domain and range are subsets of X$X$ under the usual composition and inversion of partial functions. For an arbitrary infinite set X$X$, we classify all maximal subsemigroups and maximal inverse subsemigroups of IX$I_X$ which contain the symmetric ...
M. Hampenberg, Y. Péresse
wiley +1 more source
A homomorphism from the affine Yangian $Y_{\hbar,\varepsilon}(\widehat{\mathfrak{sl}}(n))$ to the affine Yangian $Y_{\hbar,\varepsilon}(\widehat{\mathfrak{sl}}(n+1))$ [PDF]
We construct a homomorphism from the affine Yangian $Y_{\hbar,\varepsilon}(\widehat{\mathfrak{sl}}(n))$ to the affine Yangian $Y_{\hbar,\varepsilon}(\widehat{\mathfrak{sl}}(n+1))$.
Ueda, Mamoru
core
The Homomorphism Poset of K_{2,n} [PDF]
oai:arXiv.org:1008.1736A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position.
Cockburn, Sally, Song, Yonghyun
core +1 more source
When do homomorphism counts help in query algorithms? [PDF]
A query algorithm based on homomorphism counts is a procedure for determining whether a given instance satisfies a property by counting homomorphisms between the given instance and finitely many predetermined instances.
Dalmau, Víctor +3 more
core +4 more sources

