Related papers: Overhang
We study Hamiltonicity in random subgraphs of the hypercube $\mathcal{Q}^n$. Our first main theorem is an optimal hitting time result. Consider the random process which includes the edges of $\mathcal{Q}^n$ according to a uniformly chosen…
For the thin obstacle problem in 3d, we show that half-space solutions form an isolated family in the space of $7/2$-homogeneous solutions. For a general solution with one blow-up profile in this family, we establish the rate of convergence…
In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…
We prove an optimal order error bound in the discrete $H^2(\Omega)$ norm for finite difference approximations of the first boundary-value problem for the biharmonic equation in $n$ space dimensions, with $n \in \{2,\dots,7\}$, whose…
In this paper, we study discrepancy questions for spanning subgraphs of $k$-uniform hypergraphs. Our main result is that, for any integers $k \ge 3$ and $r \ge 2$, any $r$-colouring of the edges of a $k$-uniform $n$-vertex hypergraph $G$…
Witsenhausen's problem asks for the maximum fraction $\alpha_n$ of the $n$-dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. The best upper bounds for $\alpha_n$ are given by…
The upper estimates for the optimal constants of the multilinear Bohnenblust--Hille inequality obtained in [J. Funct. Anal. 264 (2013), 429--463] are here improved to: {0.1cm} {enumerate} For real scalars:…
An almost $k$-cover of the hypercube $Q^n = \{0,1\}^n$ is a collection of hyperplanes that avoids the origin and covers every other vertex at least $k$ times. When $k$ is large with respect to the dimension $n$, Clifton and Huang…
A cycle of length $t$ in a hypergraph is an alternating sequence $v_1,e_1,v_2\dots,v_t,e_t$ of distinct vertices $v_i$ and distinct edges $e_i$ so that $\{v_i,v_{i+1}\}\subseteq e_i$ (with $v_{t+1}:=v_1$). Let $\lambda K_n^h$ be the…
Classical harmonic analysis says that the spaces of homogeneous harmonic polynomials (solutions of Laplace equation) are irreducible modules of the corresponding orthogonal Lie group (algebra) and the whole polynomial algebra is a free…
Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…
Suppose that finitely many disjoint open arcs have been selected on the unit circle, each of length less than $\pi$. Let $L_0$ be a longest among them. One can treat the unit disk as a hyperbolic plane in the Poincare disk model. From this…
In this paper we establish that the time-harmonic elasticity problem in a half-strip with non-homogeneous Dirichlet conditions on its boundary section and traction-free conditions on its upper and lower boundaries, has a unique weak…
This paper deals with the error estimate in problems of periodic homogenization. The methods used are those of the periodic unfolding. We give the upper bound of the distance between the unfolded gradient of a function belonging to…
An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement 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…
The second part of the Hilbert's sixteenth problem consists in determining the upper bound $\mathcal{H}(n)$ for the number of limit cycles that planar polynomial vector fields of degree $n$ can have. For $n\geq2$, it is still unknown…
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…
We establish a hook length bias between self-conjugate partitions and partitions of distinct odd parts, demonstrating that there are more hooks of fixed length $t \geq 2$ among self-conjugate partitions of $n$ than among partitions of…
We consider equilibrium one-on-one conversations between neighbors on a circular table, with the goal of assessing the likelihood of a (perhaps) familiar situation: sitting at a table where both of your neighbors are talking to someone…