相关论文: An exploration of the permanent-determinant method
We link $n$-jets of the affine monomial scheme defined by $x^p$ to the stable set polytope of some perfect graph. We prove that, as $p$ varies, the dimension of the coordinate ring of a certain subscheme of the scheme of $n$-jets as a…
A dominating induced matching, also called an efficient edge domination, of a graph $G=(V,E)$ with $n=|V|$ vertices and $m=|E|$ edges is a subset $F \subseteq E$ of edges in the graph such that no two edges in $F$ share a common endpoint…
The exactly solvable four-vertex model with the fixed boundary conditions in the presence of inhomogeneous linearly growing external field is considered. The partition function of the model is calculated and represented in the determinantal…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…
A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, together with the edges, must be added to the drawing. We…
We extend many known results for harmonic maps from the 2-sphere into a Grassmannian to harmonic maps of finite uniton number from an arbitrary Riemann surface. Our method relies on a new theory of nilpotent cycles arising from the diagrams…
We characterize the sequences of fixed point indices $\{i(f^n, p)\}_{n\ge 1}$ of fixed points that are isolated as an invariant set and continuous maps in the plane. In particular, we prove that the sequence is periodic and $i(f^n, p) \le…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…
In this note we settle two open problems in the theory of permanents by using recent results from other areas of mathematics. Bapat conjectured that certain quotients of permanents, which generalize symmetric function means, are concave. We…
A matching M is a dominating induced matching of a graph, if every edge of the graph is either in $M$ or has a common end-vertex with exactly one edge in $M$. The concept of complete dominating induced matching is introduced as graphs where…
The statistical finite element method (StatFEM) is an emerging probabilistic method that allows observations of a physical system to be synthesised with the numerical solution of a PDE intended to describe it in a coherent statistical…
We provide sharp bounds for the isoperimetric constants of infinite plane graphs (tessellations) with bounded vertex and face degrees. For example, if $G$ is a plane graph satisfying the inequalities $p_1 \leq \mbox{deg}\ v \leq p_2$ for $v…
A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…
Hladky, Hu, and Piguet [Tilings in graphons, preprint] introduced the notions of matching and fractional vertex covers in graphons. These are counterparts to the corresponding notions in finite graphs. Combinatorial optimization studies the…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…
Motivated by the recent developments on the complexity of non-com\-mu\-ta\-tive determinant and permanent [Chien et al.\ STOC 2011, Bl\"aser ICALP 2013, Gentry CCC 2014] we attempt at obtaining a tight characterization of hard instances of…
The monomer-dimer model is fundamental in statistical mechanics. However, it is $#P$-complete in computation, even for two dimensional problems. A formulation in matrix permanent for the partition function of the monomer-dimer model is…