Related papers: Fully Packed Loop configurations in a triangle
In this article we combinatorially describe the triangles that are present in two types of line arrangements, those which have global cyclicity and those which are infinity type line arrangements. A combinatorial nomenclature has been…
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…
We propose relational linear programming, a simple framework for combing linear programs (LPs) and logic programs. A relational linear program (RLP) is a declarative LP template defining the objective and the constraints through the logical…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips. In particular, we provide an enumeration…
The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the…
In combinatorial problems it is sometimes possible to define a $G$-equivariant mapping from a space $X$ of configurations of a system to a Euclidean space $\mathbb{R}^m$ for which a coincidence of the image of this mapping with an…
Max-Plus Linear (MPL) systems are an algebraic formalism with practical applications in transportation networks, manufacturing and biological systems. In this paper, we investigate the problem of automatically analyzing the properties of…
We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…
Perfectly matched layers (PMLs) are formulated and applied to numerically solve nonlocal Helmholtz equations in one and two dimensions. In one dimension, we present the PML modifications for the nonlocal Helmholtz equation with general…
When can $t$ terminal pairs in an $m \times n$ grid be connected by $t$ vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our hardness result can be compared to two previous NP-hardness…
In this paper, we showcase the class XNLP as a natural place for many hard problems parameterized by linear width measures. This strengthens existing $W[1]$-hardness proofs for these problems, since XNLP-hardness implies $W[t]$-hardness for…
The stability problem of a class of nonlinear switched systems defined on compact sets with state-dependent switching is considered. Instead of the Caratheodory solutions, the general Filippov solutions are studied. This encapsulates…
The Fagundes-Mello conjecture asserts that every multilinear polynomial on upper triangular matrix algebras is a vector space, which is an improtant variation of the old and famous Lvov-Kaplansky conjecture. The goal of the paper is to give…
Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the…
Superregular matrices have the property that all of their submatrices, which can be full rank are so. Lower triangular superregular matrices are useful for e.g., maximum distance separable convolutional codes as well as for (sequential)…
A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…
A linkage $\mathcal{L}$ consists of a graph $G=(V,E)$ and an edge-length function $\ell$. Deciding whether $\mathcal{L}$ can be realized as a planar straight-line embedding in $\mathbb{R}^2$ with edge length $\ell(e)$ for all $e \in E$ is…
The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capacity at bit error rates down to $10^{-15}$. Such…
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…