Related papers: The Only Complex 4-Net Is the Hesse Configuration
In this paper we explore enumeration problems related to the number of reachable configurations in a chip-firing game on a finite connected graph G. We define an auxiliary notion of debt-reachability and prove that the number of…
The restricted $h$-connectivity of a graph $G$, denoted by $\kappa^h(G)$, is defined as the minimum cardinality of a set of vertices $F$ in $G$, if exists, whose removal disconnects $G$ and the minimum degree of each component of $G-F$ is…
We study the reciprocal position of nine points in the plane, according to their collinearities. In particular, we consider the case in which the nine points are contained in an irreducible cubic curve and we give their classification. If…
It is shown that among all tight designs in FP^n, where F is R, C, or H (quaternions), other than RP^1, only 5-designs in CP^1 have irrational angle set. This is the only case of equal ranks of the first and the last irreducible idempotent…
Financial networks raise a significant computational challenge in identifying insolvent firms and evaluating their exposure to systemic risk. This task, known as the clearing problem, is computationally tractable when dealing with simple…
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three classes of the 3-net comprises concurrent lines, and irregular…
The topology of many real complex networks has been conjectured to be embedded in hidden metric spaces, where distances between nodes encode their likelihood of being connected. Besides of providing a natural geometrical interpretation of…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
We consider quasinormal modes with complex energies from the point of view of the theory of quasi-exactly solvable (QES) models. We demonstrate that it is possible to find new potentials which admit exactly solvable or QES quasinormal modes…
We prove that under certain combinatorial conditions, the realization spaces of line arrangements on the complex projective plane are connected. We also give several examples of arrangements with eight, nine and ten lines which have…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
A 1-2 model configuration is a subset of edges of the hexagonal lattice such that each vertex is incident to one or two edges. We prove that for any translation-invariant Gibbs measure of 1-2 model, almost surely the infinite homogeneous…
We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…
A classification and examples of four-dimensional isoclinic three-webs of codimension two are given. The examples considered prove the existence theorem for many classes of webs for which the general existence theorems are not proved yet.
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…
We show that two important problems that have applications in computational biology are ASP-complete, which implies that, given a solution to a problem, it is NP-complete to decide if another solution exists. We show first that a variation…
Let $M^3 \subset \mathbb{C}^2$ be a $\mathcal{C}^\omega$ Levi nondegenerate hypersurface. In the literature, Cartan-Moser chains are detected from rather advanced considerations: either from the construction of a Cartan connection…
It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence with the stable matchings of $I$. Furthermore, for every poset…
We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an executable plan exists, and whether a given state can be…
The paper establishes that the rank of a regular polygonal complex in 3-space E^3 cannot exceed 4, and that the only regular polygonal complexes of rank 4 in 3-space are the eight regular 4-apeirotopes.