相关论文: Matching Fields in Macaulay2
Chaotic attractors are solutions of deterministic processes, of which the topology can be described by templates. We consider templates of chaotic attractors bounded by a genus-1 torus described by a linking matrix. This article introduces…
A \emph{matching} is a subset of edges in a graph $G$ that do not share an endpoint. A matching $M$ is a \emph{$\mathcal{P}$-matching} if the subgraph of $G$ induced by the endpoints of the edges of $M$ satisfies property $\mathcal{P}$. For…
Dense geometric matching determines the dense pixel-wise correspondence between a source and support image corresponding to the same 3D structure. Prior works employ an encoder of transformer blocks to correlate the two-frame features.…
A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximum cardinality is a well-solved problem, it is NP-hard to…
Conformal primary fields are of central importance in a conformal field theory with d > 2 spacetime dimensions. They can be defined in two ways. A first definition involves commutators between the field and the generators of the conformal…
This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost…
Coupled matrix and tensor factorizations (CMTF) have emerged as an effective data fusion tool to jointly analyze data sets in the form of matrices and higher-order tensors. The PARAFAC2 model has shown to be a promising alternative to the…
We present a general construction of all correlation functions of a two-dimensional rational conformal field theory, for an arbitrary number of bulk and boundary fields and arbitrary topologies. The correlators are expressed in terms of…
We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…
In this paper we provide a description of the package \textit{PolyominoIdeals} for \textit{Macaulay2} that allows to deal with collections of cells, polyominoes and related binomial ideals.
We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes $A$ and $B$, the algorithm computes a transformation $t$ such that with high…
A simple generating procedure for Lagrangians of conformal gauge fields of mixed-symmetry type is presented. The construction originates from the analysis of the near-boundary behaviour of the associated AdS gauge fields using the ambient…
Graph matching aims to establish correspondences between vertices of graphs such that both the node and edge attributes agree. Various learning-based methods were recently proposed for finding correspondences between image key points based…
The modular commutator is a recently discovered multipartite entanglement measure that quantifies the chirality of the underlying many-body quantum state. In this Letter, we derive a universal expression for the modular commutator in…
Topological field theory in three dimensions provides a powerful tool to construct correlation functions and to describe boundary conditions in two-dimensional conformal field theories.
The matching basis in field extentions is introduced by S. Eliahou and C. Lecouvey in [2]. In this paper we define the minimal and maximal linear matching property for field extensions and prove that if K is not algebraically closed, then K…
We introduce the notion of tropical Lagrangian multi-sections over a fan and study its relation with toric vector bundles. We also introduce a "SYZ-type" construction for toric vector bundles which gives a reinterpretation of Kaneyama's…
We introduce, and partially resolve, a conjecture that brings a three-centuries-old derangements phenomenon and its much younger two-decades-old analogue under the same umbrella. Through a graph-theoretic lens, a derangement is a perfect…
Template matching is a fundamental task in computer vision and has been studied for decades. It plays an essential role in manufacturing industry for estimating the poses of different parts, facilitating downstream tasks such as robotic…
We test a proposed mirror map at the level of correlators for linear models describing the (0,2) moduli space of superconformal field theories with a (2,2) locus associated to Calabi-Yau hypersurfaces in toric varieties. We verify in…