Related papers: Transformations of partial matchings
A set of fundamental matrices relating pairs of cameras in some configuration can be represented as edges of a "viewing graph". Whether or not these fundamental matrices are generically sufficient to recover the global camera configuration…
A coincidence site lattice is a sublattice formed by the intersection of a lattice $\Gamma$ in $\mathbb{R}^d$ with the image of $\Gamma$ under a linear isometry. Such a linear isometry is referred to as a linear coincidence isometry of…
Partial differential equations (PDEs) are at the heart of many mathematical and scientific advances. While great progress has been made on the theory of PDEs of standard types during the last eight decades, the analysis of nonlinear PDEs of…
We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…
For each finite configuration of distinct points in the plane, there is an associated lattice of noncrossing partitions. When these points form the vertices of a convex polygon, the result is the classical noncrossing partition lattice,…
The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of partial transpose from a combinatorial point of view. In this perspective, we solve some basic…
Optimization is a critical tool for addressing a broad range of human and technical problems. However, the paradox of advanced optimization techniques is that they have maximum utility for problems in which the relationship between the…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent…
In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number, and present two lower bounds for the algebraic…
The covering of the affine symmetry group, a semidirect product of translations and special linear transformations, in $D \geq 3$ dimensional spacetime is considered. Infinite dimensional spinorial representations on states and fields are…
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…
We discuss the concept of transformations among reference frames (classical or quantum). Usually transformations among classical reference frames have sharply defined parameters; geometrically they can be considered as {pure states in the…
Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…
We study cliques in graphs arising from quadratic forms where the vertices are the elements of the module of the quadratic form and two vertices are adjacent if their difference represents some fixed scalar. We determine structural…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
We introduce two simple two-dimensional lattice models to study traffic flow in cities. We have found that a few basic elements give rise to the characteristic phase diagram of a first-order phase transition from a freely moving phase to a…
Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements…