Related papers: Intersection Queries for Flat Semi-Algebraic Objec…
We study partial supersymmetry breaking from ${\cal N}=2$ to ${\cal N}=1$ by adding non-linear terms to the ${\cal N}=2$ supersymmetry transformations. By exploiting the necessary existence of a deformed supersymmetry algebra for partial…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…
Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…
Certain $*$-semigroups are associated with the universal $C^*$-algebra generated by a partial isometry, which is itself the universal $C^*$-algebra of a $*$-semigroup. A fundamental role for a $*$-structure on a semigroup is emphasized, and…
Characterizing microstructure-material-property relations calls for software tools which extract point-cloud- and continuum-scale-based representations of microstructural objects. Application examples include atom probe, electron, and…
A family of graphs F is said to be triangle-intersecting if for any two graphs G,H in F, the intersection of G and H contains a triangle. A conjecture of Simonovits and Sos from 1976 states that the largest triangle-intersecting families of…
A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been known. This paper introduces a new subclass of linear-interval orders. We call a partial…
This paper provides an in-depth analysis of how computational algebraic geometry can be used to deal with the problem of counting and classifying $r\times s$ partial Latin rectangles based on $n$ symbols of a given size, shape, type or…
In this paper, we investigate the existence of parameterized algorithms running in subexponential time for two fundamental cycle-hitting problems: Feedback Vertex Set (FVS) and Triangle Hitting (TH). We focus on the class of pseudo-disk…
The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edge-edge crossings, no…
We show that in the quantum query model the complexity of detecting a triangle in an undirected graph on $n$ nodes can be done using $O(n^{1+{3\over 7}}\log^{2}n)$ quantum queries. The same complexity bound applies for outputting the…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
A trigraph is a graph where each pair of vertices is labelled either 0 (a non-arc), 1 (an arc) or $\star$ (both an arc and a non-arc). In a series of papers, Hell and co-authors proposed to study the complexity of homomorphisms from graphs…
The CREAM GAP package computes automorphisms, congruences, endomorphisms and subalgebras of algebras with an arbitrary number of binary and unary operations; it also decides if between two such algebras there exists a monomorphism, an…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
By elaborating on the recent progress made in the area of Feynman integrals, we apply the intersection theory for twisted de Rham cohomologies to simple integrals involving orthogonal polynomials, matrix elements of operators in Quantum…
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present…