相关论文: The Principal Component of the Jets of a Graph
Motivated by using combinatorics to study jets of monomial ideals, we extend a definition of jets from graphs to clutters. We offer some structural results on their vertex covers, and show an interesting connection between the cover ideal…
We define an operation of jets on graphs inspired by the corresponding notion in commutative algebra and algebraic geometry. We examine a few graph theoretic properties and invariants of this construction, including chromatic numbers,…
In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…
For $m\in \mathbb{N}, m\geq 1,$ we determine the irreducible components of the $m-th$ jet scheme of a normal toric surface $S.$ We give formulas for the number of these components and their dimensions. When $m$ varies, these components give…
In this paper we give a complete description of the irreducible components of the jet schemes (with origin in the singular locus) of a two-dimensional quasi-ordinary hypersurface singularity. We associate with these components and with…
A digraph that represents reasonably a scheduling problem should be a directed acyclic graph. Here down we shall deal with special kind of graded $DAGs$ named $KoDAGs$. For their definition and first primary properties see $ [1]$, where…
Designing model-independent anomaly detection algorithms for analyzing LHC data remains a central challenge in the search for new physics, due to the high dimensionality of collider events. In this work, we develop a graph autoencoder as an…
We introduce a Macaulay2 package for working with jet schemes. The main method constructs jets of ideals, polynomial rings and their quotients, ring homomorphisms, affine varieties, and (hyper)graphs. The package also includes additional…
We study jet schemes of Newton non-degenerate plane curve singularities. We identify a subgraph of the graph of jet components and show that it can be constructed from walks on the lattice points in the first quadrant of the Cartesian…
We associate a sequence of positive integers, termed the type sequence, with a cochordal graph. Using this type sequence, we compute all graded Betti numbers of its edge ideal. We then classify all positive integer $n$ such that the zero…
The identification of jets and their constituents is one of the key problems and challenging task in heavy ion experiments such as experiments at RHIC and LHC. The presence of huge background of soft particles pose a curse for jet finding…
A very important issue concerning protostellar jets is the mechanism behind their formation. Obtaining information on the region at the base of a jet can shed light into the subject and some years ago this has been done through a search for…
A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…
Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
The global structure of the atmosphere and the oceans is a continuous source of intriguing challenges in geophysical fluid dynamics (GFD). Among these, jets are determinant in the air and water circulation around the Earth. In the last…
This paper is the first from a series of papers that provide a characterization of maximum packings of $T$-cuts in bipartite graphs. Given a connected graph, a set $T$ of an even number of vertices, and a minimum $T$-join, an edge weighting…
Jet classification is an important ingredient in measurements and searches for new physics at particle coliders, and secondary vertex reconstruction is a key intermediate step in building powerful jet classifiers. We use a neural network to…
To each variety $X$ and a nonnegative integer $m$, there is a space $X_m$ over $X$, called the jet scheme of $X$ of order $m$, parametrizing $m$-th jets on $X$. Its fiber over a singular point of $X$ is called a singular fiber. For a…
This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set--Based Graph. The algorithm, under certain restrictions on those sets, has the…