Related papers: On partial parallel classes in partial Steiner tri…
We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…
For a family ${\mathcal F}$ of $r$-graphs, let $\mathrm{ex}(n,{\mathcal F})$ denote the maximum number of edges in an ${\mathcal F}$-free $r$-graph on $n$ vertices. Let ${\mathcal F}_r(v,e)$ denote the family of all $r$-graphs with $e$…
Let $\|\cdot\|$ denote the minimum distance to an integer. For $0<\gamma< 1$, $\theta>0$ and $(\alpha, \beta) \in \mathbb{R} \setminus \{0\} \times \mathbb{R}$ we study when \begin{equation*} \|\alpha p^{\gamma}+\beta \|<p^{-\theta},…
Let $\lfloor t\rfloor$ denote the integer part of $t\in\mathbb{R}$ and $\|x\|$ the distance from $x$ to the nearest integer. Suppose that $1/2<\gamma_2<\gamma_1<1$ are two fixed constants. In this paper, it is proved that, whenever $\alpha$…
We consider 4-block $n$-fold integer programming, which can be written as $\max\{w\cdot x: H x=b, l\le x\le u, x\in \mathbb{Z}^{N} \}$ where the constraint matrix $H$ is composed of small submatrices $A,B,C,D$ such that the first row of $H$…
We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) $n\textrm{-by-}n$ matrix is $\Theta(n^{4/3})$ (resp. $\Theta(n^{3/2}$)). Relationships with point-line incidences in the plane, Bruhat order…
The concept of Schreier extensions of loops was introduced in the general case in [11] and, more recently, it has been explored in the context of Steiner loops in [6]. In the latter case, it gives a powerful method for constructing Steiner…
In this paper, we consider the family of planar piecewise linear differential systems with two zones separated by a straight line without sliding regions, that is, differential systems whose flow transversally crosses the switching line…
An \emph{independent transversal} (IT) in a graph $G$ with a given vertex partition $P$ is an independent set of vertices of $G$ (i.e. it induces no edges), that consists of one vertex from each part (\emph{block}) of $P$. Over the years,…
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and related to…
We study statistics of records in a sequence of random variables. These identical and independently distributed variables are drawn from the parent distribution rho. The running record equals the maximum of all elements in the sequence up…
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.…
Finding a maximum clique in a given graph is one of the fundamental NP-hard problems. We compare two multi-core thread-parallel adaptations of a state-of-the-art branch and bound algorithm for the maximum clique problem, and provide a novel…
Let $h(n)$ denote the maximum number of triangles with angles between $59^\circ$ and $61^\circ$ in any $n$-element planar set. Our main result is an exact formula for $h(n)$. We also prove $h(n)= n^3/24+ O(n \log n)$ as $n\to \infty$.…
Wegner conjectured that if $G$ is a planar graph with maximum degree $\Delta\ge 8$, then $\chi(G^2)\le \left\lfloor \frac32\Delta\right\rfloor +1$. This problem has received much attention, but remains open for all $\Delta\ge 8$. Here we…
The Steiner $k$-eccentricity of a vertex in graph $G$ is the maximum Steiner distance over all $k$-subsets containing the vertex. %Some general properties of the Steiner 3-eccentricity of trees are given. Let $\mathbb{T}_n$ be the set of…
We study two problems that seek a subtree $T$ of a graph $G=(V,E)$ such that $T$ satisfies a certain property and has minimal maximum degree. - In the Min-Degree Group Steiner Tree problem we are given a collection ${\cal S}$ of groups…
The concept of metric dimension has applications in a variety of fields, such as chemistry, robotic navigation, and combinatorial optimization. We show bounds for graphs with $n$ vertices and metric dimension $\beta$. For Hamiltonian…
We study the separability of bipartite quantum systems in arbitrary dimensions based on the Bloch representation of density matrices. We present two separability criteria for quantum states in terms of the matrices $T_{\alpha\beta}(\rho)$…
Two novel computing models based on an infinite tessellation of space-time are introduced. They consist of recursively coupled primitive building blocks. The first model is a scale-invariant generalization of cellular automata, whereas the…