Related papers: Combinatorial rigidity of multicritical maps

A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the…

The aim of this note is to exploit a new relationship between additive combinatorics and the geometry of monomial projective curves. We associate to a finite set of non-negative integers $A=\{a_1,\cdots, a_n\}$ a monomial projective curve…

Using the technique of enrichment of contractive type mappings by Krasnoselskij averaging, presented here for the first time, we introduce and study the class of {\it enriched nonexpansive mappings} in Hilbert spaces. In order to…

We study moduli spaces of stable maps from pointed curves, where the points are allowed to coincide, with target a tame Deligne-Mumford stack. This generalizes the Abramovich-Vistoli theory of twisted stable maps as well as work of Hassett,…

We provide a combinatorial characterization of all testable properties of $k$-uniform hypergraphs ($k$-graphs for short). Here, a $k$-graph property $P$ is testable if there is a randomized algorithm which makes a bounded number of edge…

Let $R_{n}$ denote the graph with vertex set consisting of the squares of an $n \times n$ grid, with two squares of the grid adjacent when they lie in the same row or column. This is the square rook's graph, and can also be thought of as…

Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…

In this paper, combining the works of Miyanishi-Tsunoda and Keel-McKernan, we prove the log Castelnuovo's rationality criterion for smooth quasiprojective surfaces over complex numbers.

Sarkar and Wang have given a combinatorial algorithm for computing Heegaard Floer homology and Plamenevskaya has improved their method to compute Ozsvath-Szabo invariant. In this paper, applying the combinatorial method to stabilizations of…

A result of Keel and McKernan states that a hypothetical counterexample to the F-conjecture must come from rigid curves on $\bar {M}_{0,n}$ that intersect the interior. We exhibit several ways of constructing rigid curves. In all our…

We prove strong statistical stability of a large class of one-dimensional maps which may have an arbitrary finite number of discontinuities and of non-degenerate critical points and/or singular points with infinite derivative, and satisfy…

Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…

Let G be a group, Fin the family of its finite subgroups, and E(G,Fin) the classifying space. Let L^1 be the algebra of trace-class operators in an infinite dimensional, separable Hilbert space over the complex numbers. Consider the…

Recent advances in Multiagent Systems (MAS) and Epistemic Logic within Distributed Systems Theory, have used various combinatorial structures that model both the geometry of the systems and the Kripke model structure of models for the…

Persistence modules stratify their underlying parameter space, a quality that make persistence modules amenable to study via invariants of stratified spaces. In this article, we extend a result previously known only for one-parameter…

Let $\fg$ be the Lie superalgebra $\fgl(m,n).$ Algorithms for computing the composition factors and multiplicities of Kac modules for $\fg$ were given by the second author in 1996, and by J. Brundan in 2003. We give a combinatorial proof of…

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

This note gives a detailed proof of the following statement. Let $d\in \mathbb{N}$ and $m,n \ge d + 1$, with $m + n \ge \binom{d+2}{2} + 1$. Then the complete bipartite graph $K_{m,n}$ is generically globally rigid in dimension $d$.

Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…

Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial…