Results 1 to 10 of about 65,406 (219)
Total Proper Connection and Graph Operations [PDF]
Journal of Interconnection Networks, 2021 A graph is said to be total-colored if all the edges and vertices of the graph are colored. A path in a total-colored graph is a total proper path if (i) any two adjacent edges on the path differ in color, (ii) any two internal adjacent vertices on the path differ in color, and (iii) any internal vertex of the path differs in color from its incident ...
Yingying Zhang, Xiaoyu Zhu
openaire +2 more sources
Connective $K$-theory and Adams operations [PDF]
EMS Surveys in Mathematical Sciences, 2021 We investigate the relations between the Grothendieck group of coherent modules of an algebraic variety and its Chow group of algebraic cycles modulo rational equivalence. Those are in essence torsion phenomena, which we attempt to control by considering the action of the Adams operations on the Brown–Gersten–Quillen spectral ...
Haution O., Merkurjev A. S.
openaire +3 more sources
Operations in connective K-theory
Algebra & Number Theory, 2023 In this article we classify additive operations in connective K-theory with various torsion-free coefficients. We discover that the answer for the integral case requires understanding of the $\hat{\mathbb{Z}}$ one. Moreover, although integral additive operations are topologically generated by Adams operations, these are not reduced to infinite linear ...
Merkurjev, Alexander, Vishik, Alexander
openaire +2 more sources
First-order Logic with Connectivity Operators
ACM Transactions on Computational Logic, 2023 First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem parameterized by solution size. However, FO cannot express the very simple algorithmic question whether two vertices are connected.
Nicole Schirrmacher +2 more
openaire +5 more sources
Binary operators and connective rules [PDF]
Proceedings of North American Fuzzy Information Processing, 2002 The main aim of this paper is to point out that a connective rule should be understood as a consistent family of connectives, in such a way that given any finite sequence of values we can evaluate its connective value. A connective rule is what we really need in practice, not a single connective operator. Only in some few cases we can characterize such
CUTELLO, Vincenzo, Molina E, Montero J.
openaire +4 more sources
Document Binarization Based on Connected Operators [PDF]
2009 10th International Conference on Document Analysis and Recognition, 2009 An original binarization method based on connected operators is proposed in this paper. Connected operators enable to filter and/or segment an image by preserving its contours. The proposed binarization method enables to extract relevant document objects by means of the component-tree structure.
Naegel, Benoît, Wendling, Laurent
openaire +1 more source
The geometric νSMEFT: operators and connections
Journal of High Energy Physics, 2023 Abstract We write down a geometric realization of the Standard Model Effective Field Theory (SMEFT) extended by nf flavours of light sterile neutrinos, a so-called geoνSMEFT. As with the geoSMEFT introduced by Helset, Martin and Trott, we show that a refactorization of the νSMEFT’s operator product expansion is possible, such that ...
openaire +5 more sources
Proper Vertex Connection and Graph Operations [PDF]
Journal of Interconnection Networks, 2019 A path in a vertex-colored graph is a vertex-proper path if any two internal adjacent vertices differ in color. A vertex-colored graph is proper vertex k-connected if any two vertices of the graph are connected by k disjoint vertex-proper paths of the graph.
Yingying Zhang, Xiaoyu Zhu
openaire +2 more sources
Practical Extensions of Connected Operators
, 1996 This paper deals with the notion of connected operators. These operators are becoming popular in image processing because they have the fundamental property of simplifying the signal while preserving the contour information. In this paper, we discuss some practical approaches for the extension and the generalization of these operators. We focus on
Oliveras Vergés, Albert +1 more
openaire +2 more sources
Connected Morphological Operators for Binary Images [PDF]
Computer Vision and Image Understanding, 1999 Summary: This paper presents a comprehensive discussion on connected morphological operators for binary images. Introducing a connectivity on the underlying space, every image induces a partition of the space in foreground and background components. A connected operator is an operator that coarsens this partition for every input image.
openaire +1 more source