Related papers: Conference matrices with maximum excess and two-in…

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

We continue the study by Melo and Winter [arXiv:1712.01763, 2017] on the possible intersection sizes of a $k$-dimensional subspace with the vertices of the $n$-dimensional hypercube in Euclidean space. Melo and Winter conjectured that all…

We introduce graph width parameters, called $\alpha$-edge-crossing width and edge-crossing width. These are defined in terms of the number of edges crossing a bag of a tree-cut decomposition. They are motivated by edge-cut width, recently…

In this paper, we discuss the maximum flow problem in the two-party communication model, where two parties, each holding a subset of edges on a common vertex set, aim to compute the maximum flow of the union graph with minimal…

We show that in minimal supersymmetric standard model (MSSM) with R-parity breaking as well as in the left-right symmetric model, there are new observable contributions to neutrinoless double beta decay arising from hitherto overlooked…

To study how balanced or unbalanced a maximal intersecting family $\mathcal{F}\subseteq \binom{[n]}{r}$ is we consider the ratio $\mathcal{R}(\mathcal{F})=\frac{\Delta(\mathcal{F})}{\delta(\mathcal{F})}$ of its maximum and minimum degree.…

The border-collision normal form is a canonical form for two-dimensional, continuous maps comprised of two affine pieces. In this paper we provide a guide to the dynamics of this family of maps in the non-invertible case where the two…

This paper studies the Hausdorff dimension of the intersection of isotropic projections of subsets of $\mathbb{R}^{2n}$, as well as dimension of intersections of sets with isotropic planes. It is shown that if $A$ and $B$ are Borel subsets…

In this paper we present a complete characterization of the smallest sets which block all the simple perfect matchings in a complete convex geometric graph on $2m$ vertices. In particular, we show that all these sets are caterpillar graphs…

Let $\{(A_i,B_i)\}_{i=1}^m$ be a set pair system. F\"{u}redi, Gy\'{a}rf\'{a}s and Kir\'{a}ly called it {\em $1$-cross intersecting} if $|A_i\cap B_j|$ is $1$ when $i\neq j$ and $0$ if $i=j$. They studied such systems and their…

Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the…

Let $G(n,\, M)$ be the uniform random graph with $n$ vertices and $M$ edges. Let $B_n$ be the maximum block-size of $G(n,\, M)$ or the maximum size of its maximal $2$-connected induced subgraphs. We determine the expectation of $B_n$ near…

This paper considers multiple-input multiple-output (MIMO) relay communication in multi-cellular (interference) systems in which MIMO source-destination pairs communicate simultaneously. It is assumed that due to severe attenuation and/or…

Let PG$(r, q)$ be the $r$-dimensional projective space over the finite field ${\rm GF}(q)$. A set $\cal X$ of points of PG$(r, q)$ is a cutting blocking set if for each hyperplane $\Pi$ of PG$(r, q)$ the set $\Pi \cap \cal X$ spans $\Pi$.…

We introduce a full set of rules to directly express all $M$-point conformal blocks in one- and two-dimensional conformal field theories, irrespective of the topology. The $M$-point conformal blocks are power series expansion in some…

We improve the existing results of optimal partial profile paired choice designs and provide new designs for situations where the choice set sizes are greater than two. The optimal designs are obtained under the main effects models and the…

We introduce a recursive decomposition algorithm for the Betti diagram of a complete intersection using the diagram of a complete intersection defined by a subset of the original generators. This alternative algorithm is the main tool that…

Let $V$ be a degree $d$, reduced hypersurface in $\mathbb{CP}^{n+1}$, $n \geq 1$, and fix a generic hyperplane, $H$. Denote by $\mathcal{U}$ the (affine) hypersurface complement, $\mathbb{CP}^{n+1}- V \cup H$, and let $\mathcal{U}^c$ be the…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with…