Related papers: Volume computation for sparse boolean quadric rela…
Let $k \geq 2$ be an integer. Kouider and Lonc proved that the vertex set of every graph $G$ with $n \geq n_0(k)$ vertices and minimum degree at least $n/k$ can be covered by $k - 1$ cycles. Our main result states that for every $\alpha >…
We explore the dynamical behavior of one-dimensional quantum droplets (QDs) governed by the extended Gross-Pitaevskii equation, under harmonic confinement supplemented by a static or time-dependent Gaussian spike (Gs) potential. Employing…
This paper proposes a general framework to estimate coefficients of generalized polynomial chaos (gPC) used in uncertainty quantification via rotational sparse approximation. In particular, we aim to identify a rotation matrix such that the…
The cosmological polytope of a graph $G$ was recently introduced to give a geometric approach to the computation of wavefunctions for cosmological models with associated Feynman diagram $G$. Basic results in the theory of positive…
Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb…
A regular graph $G = (V,E)$ is an $(\varepsilon,\gamma)$ small-set expander if for any set of vertices of fractional size at most $\varepsilon$, at least $\gamma$ of the edges that are adjacent to it go outside. In this paper, we give a…
In theories of closed oriented superstrings, the one loop amplitude is given by a single diagram, with the topology of a torus. Its interpretation had remained obscure, because it was formally real, converged only for purely imaginary…
The best practical techniques for exact solution of instances of the constrained maximum-entropy sampling problem, a discrete-optimization problem arising in the design of experiments, are via a branch-and-bound framework, working with a…
Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone $C$ and its dual $C^*$. We show that whether some one-way communication complexity problems can be…
We establish a general formula for the enclosed volume of constant mean curvature (CMC) surfaces in Euclidean three space with translational periods forming a lattice. The formula relates the volume to the surface area, a…
We have derived an analytical formulation for estimating the volume of geometries enclosed by implicitly defined surfaces. The novelty of this work is due to two aspects. First we provide a general analytical formulation for all…
In this paper, we use multivariate splines to investigate the volume of polytopes. We first present an explicit formula for the multivariate truncated power, which can be considered as a dual version of the famous Brion's formula for the…
Let $K$ be a convex compact $GB$-subset of a separable Hilbert space $H$. Denote by $\mathrm{Spec}_k K$ the set $\{(\xi_1(h), \ldots, \xi_k(h))\colon h\in K\}\subset \mathbb{R}^k,$ where $\xi_1, \ldots, \xi_k$ are independent copies of the…
We consider the problem of characterizing the convex hull of the graph of a bilinear function $f$ on the $n$-dimensional unit cube $[0,1]^n$. Extended formulations for this convex hull are obtained by taking subsets of the facets of the…
Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…
We consider sampling in the so-called low-temperature regime, which is typically characterised by non-local behaviour and strong global correlations. Canonical examples include sampling independent sets on bipartite graphs and sampling from…
We show using Brownian dynamics simulations and theory how the shear relaxation modulus G(t) of dilute solutions of relatively stiff semiflexible polymers differs qualitatively from that of rigid rods. For chains shorter than their…
We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not independent. Our formulation is based on identifying vertex covers of the conflict graph of the…
Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…