Related papers: Matching Fields in Macaulay2
Recently, it has been proved that if we have a field extension, then it has linear matching property if and only if L is purely transcendental or is an extension of prime degree. In this note we provide a counterexample for this result.
A match cut is a transition between a pair of shots that uses similar framing, composition, or action to fluidly bring the viewer from one scene to the next. Match cuts are frequently used in film, television, and advertising. However,…
Crossover and mutation are the two main operators that lead to new solutions in evolutionary approaches. In this article, a new method of performing the crossover phase is presented. The problem of choice is evolutionary decision tree…
We present new and improved fixed-parameter algorithms for computing maximum agreement forests (MAFs) of pairs of rooted binary phylogenetic trees. The size of such a forest for two trees corresponds to their subtree prune-and-regraft…
Recent investigations in computational biology have focused on a family of 2-colored digraphs, called 2-colored best match graphs, which naturally arise from rooted phylogenetic trees. Actually the defining properties of such graphs are…
We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…
We introduce the concept of bi-conformal transformation, as a generalization of conformal ones, by allowing two orthogonal parts of a manifold with metric $\G$ to be scaled by different conformal factors. In particular, we study their…
The Macaulay2 package DecomposableSparseSystems implements methods for studying and numerically solving decomposable sparse polynomial systems. We describe the structure of decomposable sparse systems and explain how the methods in this…
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…
A wide range of data that appear in scientific experiments and simulations are multivariate or multifield in nature, consisting of multiple scalar fields. Topological feature search of such data aims to reveal important properties useful to…
In this paper, a new information theoretic framework for graph matching is introduced. Using this framework, the graph isomorphism and seeded graph matching problems are studied. The maximum degree algorithm for graph isomorphism is…
A frame is an overcomplete set that can represent vectors(signals) faithfully and stably. Two frames are equivalent if signals can be essentially represented in the same way, which means two frames differ by a permutation, sign change or…
The Gelfand-Tsetlin and the Feigin-Fourier-Littelmann-Vinberg polytopes for the Grassmannians are defined, from the perspective of representation theory, to parametrize certain bases for highest weight irreducible modules. These polytopes…
Our main goal is to show that the Gelfand--Tsetlin toric degeneration of the type A flag variety can be obtained within a degenerate representation-theoretic framework similar to the theory of PBW degenerations. In fact, we provide such…
We launch the study of the tropicalization of the symplectic Grassmannian, that is, the space of all linear subspaces that are isotropic with respect to a fixed symplectic form. We formulate tropical analogues of several equivalent…
We introduce combinatorial objects which are parameterized by the positive part of the tropical Grassmannian $Gr(k,n)$. Our method is to relate the Grassmannian to configuration spaces of flags. By work of the first author, and of Goncharov…
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to…
We introduce and study completely-extendable conformal intertwining algebras. Based on results obtained in other papers, various examples are given. Duals of these algebras are constructed and nondegenerate such algebras are defined. We…
In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
In this work, we present a novel and practical approach to address one of the longstanding problems in computer vision: 2D and 3D affine invariant feature matching. Our Grassmannian Graph (GrassGraph) framework employs a two stage procedure…