Matching 2-lattice polyhedra are a special class of lattice polyhedra that include network 3ow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, etc. In this paper we develop a polynomial-time extreme point algorithm for #nding a maximum cardinality vector in a matching 2-lattice polyhedron. c © 2001 Elsevier Science B.V. All rights reserved.

Lattice-matching techniques have proved to be extremely effective for the identification of unknown crystalline materials. A commonly employed lattice-matching strategy is based on matching the reduced cell of an unknown against a database of known materials represented by their respective standard reduced cells. The success of the method relies on the fact that the lattice or the lattice plus ...

We give an algorithmic computation for the height of Kauffman’s clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect matchings of a bipartite graph obtained from the knot diagram by overlaying the two dual Tait graphs of the knot diagram. Furthermore we prove str...

A bstract Transverse-momentum-dependent parton distributions (TMDs) can be calculated from first principles by computing a related set of Euclidean lattice observables and connecting them via factorization formula. This work focuses on the leading-power formula quasi-TMD continuum Collins TMD for gluons. We calculate one-loop gluon matching coefficient, which is known to independent spin exhibi...

Arrays of Ni nanodots embedded in Nb superconducting films have been fabricated by sputtering and electron-beam lithography techniques. The arrays are periodic triangular lattices of circular Ni dots arranged in a kagomélike pattern with broken reflection symmetry. Relevant behaviors are found in the vortex lattice dynamics: i at values lower than the first integer matching field, several fract...