Related papers: Binomial partial Steiner triple systems with compl…
We consider the bilevel minimum spanning tree (BMST) problem where the leader and the follower choose a spanning tree together, according to different objective functions. By showing that this problem is NP-hard in general, we answer an…
Inspired by the ideas and techniques used in the study of cluster algebras we construct a new class of algebras, called bistellar cluster algebras, from closed oriented triangulated even-dimensional manifolds by performing…
We study the Maximum Bipartite Subgraph (MBS) problem, which is defined as follows. Given a set $S$ of $n$ geometric objects in the plane, we want to compute a maximum-size subset $S'\subseteq S$ such that the intersection graph of the…
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…
Via computer search, we found seven non-isomorphic $1$-rotational Steiner systems $S(2,6,226)$ and six point-transitive Steiner systems $S(2,6,441)$, resolving two of $29$ previously undecided cases for $S(2,6,v)$.
We study the BPS spectrum of four dimensional N=2 SU(2) theory with massive fundamental matters using the D3-brane probe. Since the BPS states are realized by string webs subject to the BPS conditions, we determine explicitly the…
Type IIB string theory admits a BPS configuration in which three strings (of different type) meet at a point. Using this three string configuration we construct a string network and study its properties. In particular we prove supersymmetry…
We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…
Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…
The H-unistochastic matrices are a special class of symmetric bistochastic matrices obtained by taking the square of the absolute value of each entry of a Hermitian unitary matrix. We examine the geometric relationship of the convex hull of…
We study BPS-saturated classical solutions for the world-sheet theory of a D-string in the presence of a point charge. These solutions are interpreted as describing planar 3-string junctions, which arise because the original D-string is…
The geometric $\delta$-minimum spanning tree problem ($\delta$-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex in the tree has a degree which exceeds $\delta$, and the…
BPS spectrum with finite number of states are found for higher rank four dimensional N=2 theory engineered from six dimensional A_{N-1} (2,0) theory on a Riemann surface with various kinds of defects. The wall crossing formula is…
A vertex of a plane digraph is bimodal if all its incoming edges (and hence all its outgoing edges) are consecutive in the cyclic order around it. A plane digraph is bimodal if all its vertices are bimodal. Bimodality is at the heart of…
We provide a physical definition of new homological invariants $\mathcal{H}_a (M_3)$ of 3-manifolds (possibly, with knots) labeled by abelian flat connections. The physical system in question involves a 6d fivebrane theory on $M_3$ times a…
An Erd\H{o}s-Ko-Rado set in a block design is a set of pairwise intersecting blocks. In this article we study Erd\H{o}s-Ko-Rado sets in 2-(v,k,1) designs, Steiner systems. The Steiner triple systems and other special classes are treated…
A pentagonal geometry PENT($k$, $r$) is a partial linear space, where every line is incident with $k$ points, every point is incident with $r$ lines, and for each point $x$, there is a line incident with precisely those points that are not…
We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…
We define "BPS graphs" on punctured Riemann surfaces associated with $A_{N-1}$ theories of class $\mathcal{S}$. BPS graphs provide a bridge between two powerful frameworks for studying the spectrum of BPS states: spectral networks and BPS…
In the class of nonlinear one-parameter real maps we study those with bifurcation that exhibits period doubling cascade. The fixed points of such a map form a finite discrete real set with dimension (2^n)m, where m is the (odd) number of…