Related papers: Reductions of (v_3) configurations
We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the…
We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method…
A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cut, is known to be…
An $(n_3)$ configuration is an incidence structure equivalent to a linear hypergraph on $n$ vertices which is both 3-regular and 3-uniform. We investigate a variant in which one constraint, say 3-regularity, is present, and we allow exactly…
We prove that every internally 4-connected non-planar bipartite graph has an odd K_3,3 subdivision; that is, a subgraph obtained from K_3,3 by replacing its edges by internally disjoint odd paths with the same ends. The proof gives rise to…
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…
This paper investigates model-order reduction methods for geometrically nonlinear structures. The parametrisation method of invariant manifolds is used and adapted to the case of mechanical systems expressed in the physical basis, so that…
We study symplectic geometry of rationally connected $3$-folds. The first result shows that rationally connectedness is a symplectic deformation invariant in dimension $3$. If a rationally connected $3$-fold $X$ is Fano or $b_2(X)=2$, we…
Lov\'asz (1987) proved that every matching covered graph $G$ may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let $b(G)$ denote the number of bricks. An edge $e$ is removable if $G-e$ is also…
In 1973 Erdos asked whether there are n-vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g \ge 4 for which some g-element vertex-set contains at…
Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…
When searching for small 4-configurations of points and lines, polycyclic configurations, in which every symmetry class of points and lines contains the same number of elements, have proved to be quite useful. In this paper we construct and…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
The configuration-space topology in canonical General Relativity depends on the choice of the initial data 3-manifold. If the latter is represented as a connected sum of prime 3-manifolds, the topology receives contributions from all…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
We study two components of the boundary of the compactification of the variety I_3 of instantons of degree three. We use the desciption of I_3 as symetric (involutive) cubo-cubic transforms deduced from the Beilinson monade. It involves…
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded…
Coherent configurations (CCs) are highly regular colorings of the set of ordered pairs of a "vertex set"; each color represents a "constituent digraph." CCs arise in the study of permutation groups, combinatorial structures such as…