Related papers: Abstract tubes associated with perturbed polyhedra…
A new computationally simple method of imposing hard convex constraints on the neural network output values is proposed. The key idea behind the method is to map a vector of hidden parameters of the network to a point that is guaranteed to…
We study the alternating algorithm for the computation of the metric projection onto the closed sum of two closed subspaces in uniformly convex and uniformly smooth Banach spaces. For Banach spaces which are convex and smooth of power type,…
Higher twisted $K$-theory is an extension of twisted $K$-theory introduced by Ulrich Pennig which captures all of the homotopy-theoretic twists of topological $K$-theory in a geometric way. We give an overview of his formulation and key…
We present a new application of harmonic analysis to quantum information by constructing intriguing classes of quantum channels stemming from specific representations of multiplier algebras over locally compact groups $G$. Beginning with a…
We establish the $Q \widetilde{Q}$-systems for the twisted quantum affine algebras that were conjectured in arXiv:1606.05301. We develop the representation theory of Borel subalgebra of twisted quantum affine algebras and we construct their…
Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1x_2x_3$, over a box in the nonnegative orthant, in terms of the upper and lower bounds on the variables. This was done in…
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…
In this work we prove constructively that the complement ${\mathbb R}^n\setminus{\mathcal K}$ of an $n$-dimensional unbounded convex polyhedron ${\mathcal K}\subset{\mathbb R}^n$ and the complement ${\mathbb R}^n\setminus{\rm Int}({\mathcal…
In this article, we survey the primary research on polyhedral computing methods for constrained linear control systems. Our focus is on the modeling power of convex optimization, featured to design set-based robust and optimal controllers.…
Positive geometries provide a modern approach for computing scattering amplitudes in a variety of physical models. In order to facilitate the exploration of these new geometric methods, we introduce a Mathematica package called…
Let K(X) be the collection of all non-zero finite dimensional subspaces of rational functions on an n-dimensional irreducible variety X. For any n-tuple L_1,..., L_n in K(X), we define an intersection index [L_1,..., L_n] as the number of…
This work presents an extensive exploration of scattering and tunneling involving composite objects with intrinsic degrees of freedom. We aim at exact solutions to such scattering problems. Along this path we demonstrate solution to model…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
We generalize the Rubik's cube, together with its group of configurations, to any abstract regular polytope. After discussing general aspects, we study the Rubik's simplex of arbitrary dimension and provide a complete description of the…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
In this paper we introduce a new class of $K$-algebras associated with quivers. Given any finite chain $\mathbf{K}_r: K=K_0\subseteq K_1\subseteq ... \subseteq K_r$ of fields and a chain $\mathbf{E}_r : H_0\subset H_1\subset ... \subset…
Finding the k-medianin a network involves identifying a subset of k vertices that minimize the total distance to all other vertices in a graph. This problem has been extensively studied in computer science, graph theory, operations…
We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…
Within a Kuhn-Tucker cavity method introduced in a former paper, we study optimal stability learning for situations, where in the replica formalism the replica symmetry may be broken, namely (i) the case of a simple perceptron above the…
A striking prediction from the random matrix theory in mesoscopic physics is the existence of "open channels": waves that can use multipath interference to achieve perfect transmission across an opaque disordered medium even in the…