Related papers: The 3-way intersection problem for S(2, 4, v) desi…

A {\em cross-free} set of size $m$ in a Steiner triple system $(V,{\cal{B}})$ is three pairwise disjoint $m$-element subsets $X_1,X_2,X_3\subset V$ such that no $B\in {\cal{B}}$ intersects all the three $X_i$-s. We conjecture that for every…

The dual codes of the ternary linear codes of the residual designs of biplanes on 56 points are used to prove the nonexistence of quasi-symmetric 2-$(56,12,9)$ and 2-$(57,12,11)$ designs with intersection numbers 0 and 3, and the…

The paper is an investigation of the structure of block-transitive automorphism groups of a 3-design with small block size. Let $G$ be a block-transitive automorphism group of a nontrivial $3$-$(v,k,\lambda)$ design $\mathcal{D}$ with $k\le…

We give a simple axiomatic definition of a rational-valued invariant s(W,V,e) of triples (W,V,e), where W is a (smooth, oriented, closed) 6-manifold and V is a 3-submanifold of W, and where e is a second rational cohomology class of the…

In two-body dynamics, it is proven that for a sufficiently long flight time, generating infinitely many iso-impulse solutions is possible by solving a number of $\Delta v$-allocation problems analytically. A distinct feature of these…

The interface problem for the linear Korteweg-de Vries (KdV) equation in one-dimensional piecewise homogeneous domains is examined by constructing an explicit solution in each domain. The location of the interface is known and a number of…

The crossing number of a graph $G$ in a surface $\Sigma$, denoted by $cr_{\Sigma}(G)$, is the minimum number of pairwise intersections of edges in a drawing of $G$ in $\Sigma$. Let $k$ be an integer satisfying $k\geq 3$, the generalized…

Given a simple graph $G = (V, E)$ and a constant integer $k \ge 2$, the $k$-path vertex cover problem ({\sc P$k$VC}) asks for a minimum subset $F \subseteq V$ of vertices such that the induced subgraph $G[V - F]$ does not contain any path…

Given a graph $G = (V,E)$, a set $T$ of vertex pairs, and an integer $k$, Hitting Geodesic Intervals asks whether there is a set $S \subseteq V$ of size at most $k$ such that for each terminal pair $\{u,v\} \in T$, the set $S$ intersects at…

We study an analogue of the Erd\H{o}s-S\'os forbidden intersection problem, for families of linear maps. If $V$ and $W$ are vector spaces over the same field, we say a family $\mathcal{F}$ of linear maps from $V$ to $W$ is…

We consider the existence problem for a semi-cyclic holey group divisible design of type (n,m^t) with block size 3, which is denoted by a 3-SCHGDD of type (n,m^t). When t is odd and n\neq 8 or t is doubly even and t\neq 8, the existence…

We give necessary conditions on the invariants (d,g) of a smooth, integral curve self-linked by a complete intersection of type (a,b) in projective three space. Similar conditions are given for s.t.c.i. curves with a multiplicity three…

In this paper, we provide a complete classification of the $2$-$(v,3,\lambda )$ designs with $v\equiv 1,3\pmod{6}$ and $% v \equiv 6 \pmod{\lambda}$ admitting a flag-transitive automorphism group non-isomorphic to a subgroup of $A\Gamma…

Let $\mathcal{D}=\left(\mathcal{P},\mathcal{B} \right)$ be a symmetric $2$-$(v,k,\lambda )$ design admitting a flag-transitive, point-imprimitive automorphism group $G$ that leaves invariant a non-trivial partition $\Sigma$ of…

We use intersection theory techniques to define an invariant of closed 3-manifolds counting the characters of irreducible representations of the fundamental group in PSL(2,C). We note several properties of the invariant and compute the…

We define symmetric designs of dimension $n$ and propriety $d$, providing a unifying generalization of several classes of higher-dimensional symmetric designs previously studied. We focus on the case $n=d=3$, which leads to the following…

In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices.…

A classic result due to Douglas establishes that, for odd spread $k$ and dimension $d=\frac{1}{2}(3k+3)$, all maximum length $(d,k)$ circuit codes are isomorphic. Using a recent result of Byrnes we extend Douglas's theorem to prove that,…

In 2003, it was claimed that the following problem was solvable in polynomial time: do there exist k edge-disjoint paths of length exactly 3 between vertices s and t in a given graph? The proof was flawed, and we show that this problem is…

In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derived an overexponential lower bound on the number of nonisomorphic resolvable Steiner triple systems (STS) of order $v$, where $v=3^k$, and $3$-rank $v-k$. We develop an…