Related papers: Erd\"{o}s-Szekeres Partitioning Problem

A new and efficient algorithm is presented for the calculation of the partition function in the $S=\pm 1$ Ising model. As an example, we use the algorithm to obtain the thermal dependence of the magnetic spin susceptibility of an Ising…

This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…

In this paper we propose a new approach to the study of integrable cases based on intensive computer methods' application. We make a new investigation of Kovalevskaya and Goryachev-Chaplygin cases of Euler-Poisson equations and obtain many…

We study the following variant of the Erd\H{o}s distance problem. Given $E$ and $F$ a point sets in $\mathbb{R}^d$ and $p = (p_1, \ldots, p_q)$ with $p_1+ \cdots + p_q = d$ is an increasing partition of $d$ define $$ B_p(E,F)=\{(|x_1-y_1|,…

Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of…

The surface partition of large fragments is derived analytically within a simple statistical model by the Laplace-Fourier transformation method. In the limit of small amplitude deformations, a suggested Hills and Dales Model reproduces the…

Network partitioning has gained recent attention as a pathway to enable decentralized operation and control in large-scale systems. This paper addresses the interplay between partitioning, observability, and sensor placement (SP) in dynamic…

This paper studies a new class of integration schemes for the numerical solution of semi-explicit differential-algebraic equations of differentiation index 2 in Hessenberg form. Our schemes provide the flexibility to choose different…

In this paper, we consider saturation problems related to the celebrated Erd\H{o}s--Szekeres convex polygon problem. For each $n \ge 7$, we construct a planar point set of size $(7/8) \cdot 2^{n-2}$ which is saturated for convex $n$-gons.…

This short note provides space-efficient linear time algorithms for computing bridges, topological sorting, and strongly connected components improving on several recent results of Elmasry et al. [STACS'15], Banerjee et al. [COCOON'16] and…

Consider the stochastic evolution equation in a separable Hilbert space with a nice multiplicative noise and a locally Dini continuous drift. We prove that for any initial data the equation has a unique (possibly explosive) mild solution.…

In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…

We consider the numerical approximation of the stochastic complex Ginzburg-Landau equation with additive noise on the one dimensional torus. The complex nature of the equation means that many of the standard approaches developed for…

This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by $\bar{EDS}$) and the vertex packing problem (denoted by $\bar{DS} $) are linear programming…

We conjecture an integrability and linearizability test for dispersive Z^2-lattice equations by using a discrete multiscale analysis. The lowest order secularity conditions from the multiscale expansion give a partial differential equation…

We study linear problems defined on tensor products of Hilbert spaces with an additional (anti-) symmetry property. We construct a linear algorithm that uses finitely many continuous linear functionals and show an explicit formula for its…

We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite…

Spatially distributed problems are often approximately modelled in terms of partial differential equations (PDEs) for appropriate coarse-grained quantities (e.g. concentrations). The derivation of accurate such PDEs starting from finer…

This paper presents and analyzes a fast, robust, efficient, and optimally accurate fully discrete splitting algorithm for the Uncertainty Quantification (UQ) of parameterized Stochastic Navier-Stokes Equations (SNSEs) flow problems those…

We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.