Related papers: Volume computation for sparse boolean quadric rela…
We define certain natural finite sums of $n$'th roots of unity, called $G_P(n)$, that are associated to each convex integer polytope $P$, and which generalize the classical $1$-dimensional Gauss sum $G(n)$ defined over $\mathbb Z/ {n…
An abstract $n$-polytope $\mathcal{P}$ is a partially-ordered set which captures important properties of a geometric polytope, for any dimension $n$. For even $n \ge 2$, the incidences between elements in the middle two layers of the Hasse…
We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…
We study the statistical properties of the scattering matrix associated with generic quantum graphs. The scattering matrix is the quantum analogue of the classical evolution operator on the graph. For the energy-averaged spectral form…
We consider in R^2 the generalized elastica functional defined, for smooth functions, as the p-elastica energies of the level lines integrated over all levels. Extending the functional to L1, we study its L1-lower semicontinuous envelope…
A new master equation to mimic the dynamics of a collection of interacting random walkers in an open system is proposed and solved numerically.In this model, the random walkers interact through excluded volume interaction (single-file…
The work addresses the analogy between trivial knotting and excluded volume in looped polymer chains of moderate length, $N<N_0$, where the effects of knotting are small. A simple expression for the swelling seen in trivially knotted loops…
We extend our analysis of the soft behaviour of string amplitudes with massive insertions to closed strings at tree level (sphere). Relying on our previous results for open strings on the disk and on KLT formulae we check universality of…
We prove the following sparse approximation result for polytopes. Assume that $Q$ is a polytope in John's position. Then there exist at most $2d$ vertices of $Q$ whose convex hull $Q'$ satisfies $Q \subseteq - 2d^2 \, Q'$. As a consequence,…
Given a graph $G$, a subset $S \subseteq V(G)$ is \textit{cycle convex}, if for any vertex $v \in V(G) \setminus S$, the induced subgraph, $G[S \cup \{v\}]$ cannot form a cycle containing the vertex $v$. The \textit{exchange number} of $G$,…
We present a simple, natural #P-complete problem. Let G be a directed graph, and let k be a positive integer. We define q(G;k) as follows. At each vertex v, we place a k-dimensional complex vector x_v. We take the product, over all edges…
This note is a comment to the paper by D.R.Heath-Brown and B.Z.Moroz (Math Proc. Camb. Phil. Soc. 125 (1999)). That paper concerns with the projective surface $S$ in $\mathbb{P}^{3}$ defined by the equation $x_{1}x_{2}x_{3}=x_{4}^{3}$. It…
We consider extensions of the Shannon relative entropy, referred to as $f$-divergences.Three classical related computational problems are typically associated with these divergences: (a) estimation from moments, (b) computing normalizing…
Given an algebraic variety $X\subset\mathbb{P}^N$ with stabilizer $H$, the quotient $PGL_{N+1}/H$ can be interpreted a parameter space for all $PGL_{N+1}$-translates of $X$. We define $X$ to be a $\textit{homogeneous variety}$ if $H$ acts…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
We study the expressivity of sparse maxout networks, where each neuron takes a fixed number of inputs from the previous layer and employs a, possibly multi-argument, maxout activation. This setting captures key characteristics of…
The Optimal Power Flow (OPF) problem is central to the reliable and efficient operation of power systems, yet its non-convex nature poses significant challenges for finding globally optimal solutions. While convex relaxation techniques such…
Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block encoded matrices, a central task that lies at the heart of most prominent…
For nonconvex quadratically constrained quadratic programs (QCQPs), we first show that, under certain feasibility conditions, the standard semidefinite (SDP) relaxation is exact for QCQPs with bipartite graph structures. The exact optimal…
In this article we prove a formula for the volume of 4-dimensional polytopes, in terms of their face bivectors, and the crossings within their boundary graph. This proves that the volume is an invariant of bivector-coloured graphs in $S^3$.