Results 11 to 20 of about 2,297,961 (309)
Total Proper Connection and Graph Operations [PDF]
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 +3 more sources
Connective $K$-theory and Adams operations [PDF]
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
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
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 +8 more sources
Document Binarization Based on Connected Operators [PDF]
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 +2 more sources
Proper Vertex Connection and Graph Operations [PDF]
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 +3 more sources
The geometric νSMEFT: operators and connections
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
Modelling and calculations of unsymmetrical multi-bolted connections treated as a system for different bolt models and contact layer models between the joined parts are presented. The modelling refers to preloaded and externally loaded connections.
Rafał GRZEJDA
doaj +1 more source
Operational research in low-income countries: what, why, and how? [PDF]
Operational research is increasingly being discussed at institutional meetings, donor forums, and scientific conferences, but limited published information exists on its role from a disease-control and programme perspective.
Laserson, Kayla +17 more
core +1 more source
Increasing the strength of fixed units of wheeled and tracked machines through the use of cylindrical fits with contour connection of parts [PDF]
In the article researches of increase of strength of motionless connections of wheeled and caterpillar cars due to use of cylindrical landings with a contour connection of details are resulted.
Kurnosov N.E. +3 more
doaj +1 more source

