Related papers: The generalized trifference problem

The focus of this paper is on a thin obstacle problem where the obstacle is defined on the intersection between a hyper-plane $\Gamma$ in $\mathbb{R}^n$ and a periodic perforation $\mathcal{T}_\varepsilon$ of $\mathbb{R}^n$, depending on a…

A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

We give a simple and general central limit theorem for a triangular array of m-dependent variables. The result requires only a Lindeberg condition and avoids unnecessary extra conditions that have been used earlier. The result applies also…

Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…

The general position problem in graphs is to find the maximum number of vertices that can be selected such that no three vertices lie on a common shortest path. The mutual-visibility problem in graphs is to find the maximum number of…

This paper presents a new extension of the classical Heron problem, termed the generalized $(k,m)$-Heron problem, which seeks an optimal configuration among $k$ feasible and $m$ target non-empty closed convex sets in $\mathbb{R}^n$. The…

Let $\mathbf{T}_{\mathbf{a},\mathbf{b}}$ be the number of $3$-way contingency tables of size $m \times n \times p$ with two of its three plane-sum margins fixed by $\mathbf{a}=(a_1, \ldots, a_m) \in \mathbb{N}^m$ and $\mathbf{b}=(b_1,…

The paper considers linear problems on weighted spaces of multivariate functions of many variables. The main questions addressed are: When is it possible to approximate the solution for the original function of very many variables by the…

Given a set of $n$ points $S$ in the plane, a triangulation $T$ of $S$ is a maximal set of non-crossing segments with endpoints in $S$. We present an algorithm that computes the number of triangulations on a given set of $n$ points in time…

We investigate a covering problem in $3$-uniform hypergraphs ($3$-graphs): given a $3$-graph $F$, what is $c_1(n,F)$, the least integer $d$ such that if $G$ is an $n$-vertex $3$-graph with minimum vertex degree $\delta_1(G)>d$ then every…

Let $T$ be a linear operator on an $\mathbb{F}_q$-vector space $V$ of dimension $n$. For any divisor $m$ of $n$, an $m$-dimensional subspace $W$ of $V$ is $T$-splitting if $$ V =W\oplus TW\oplus \cdots \oplus T^{d-1}W, $$ where $d=n/m$. Let…

We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…

We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound…

This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated…

We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every…

We compute the first four perturbative coefficients of the internal energy for the twisted reduced principal chiral model (TRPCM) using numerical stochastic perturbation theory (NSPT). This matrix model has the same large $N$ limit as the…

We use a knot invariant, namely the Tristram--Levine signature to study deformations of singular points of plane curves. We find a bound on the sum of M numbers over all singularities of a generic fiber in terms of the M number of the…

The conformal fixed points of the generalized Thirring model are investigated with the help of bosonization, the large N limit and the operator product expansion. Necessary conditions on the coupling constants for conformal invariance are…