Related papers: Characterization algorithms for shift radix system…

We propose a cut-based algorithm for finding all vertices and all facets of the convex hull of all integer points of a polyhedron defined by a system of linear inequalities. Our algorithm DDM Cuts is based on the Gomory cuts and the dynamic…

We establish a novel correspondence between 4D $\mathcal N=1$ supersymmetric gauge theories on $D^2\times T^2$ and open XYZ spin chains with generalized boundary conditions, extending beyond previous 3D Bethe/gauge duality frameworks. Our…

Extremal but non-supersymmetric charged black holes with SU(2)_L spin in IIB string theory compactified to five dimensions on K^3 x S^1 are considered. These have a near-horizon or NHEK region with an enhanced SL(2,R)_L conformal symmetry.…

A locating-dominating set $D$ of a graph $G$ is a dominating set of $G$ where each vertex not in $D$ has a unique neighborhood in $D$, and the Locating-Dominating Set problem asks if $G$ contains such a dominating set of bounded size. This…

We consider a bipartite distance-regular graph $G$ with diameter $D$ at least 4 and valency $k$ at least 3. We obtain upper and lower bounds for the local eigenvalues of $G$ in terms of the intersection numbers of $G$ and the eigenvalues of…

Let $A$ be a subvariety of affine space $\mathbb{A}^n$ whose irreducible components are $d$-dimensional linear or affine subspaces of $\mathbb{A}^n$. Denote by $D(A)\subset\mathbb{N}^n$ the set of exponents of standard monomials of $A$. We…

We study packet routing in the Kautz digraph K(d,D), where every ordered pair of distinct vertices is connected by a unique shortest directed path. The regular routing introduced in earlier work schedules all ordered pairs in tau(d,D) =…

We use $\tau$-tilting theory to give a description of the wall and chamber structure of a finite dimensional algebra. We also study $\mathfrak{D}$-generic paths in the wall and chamber structure of an algebra $A$ and show that every maximal…

In this paper we investigate the family of functions representable by deep neural networks (DNN) with rectified linear units (ReLU). We give an algorithm to train a ReLU DNN with one hidden layer to *global optimality* with runtime…

We consider ensembles of planar maps with two marked vertices at distance k from each other and look at the closed line separating these vertices and lying at distance d from the first one (d<k). This line divides the map into two…

The d-dimensional Hamming torus is the graph whose vertices are all of the integer points inside an a_1 n X a_2 n X ... X a_d n box in R^d (for constants a_1, ..., a_d > 0), and whose edges connect all vertices within Hamming distance one.…

A new non-perturbative approach to quantum field theory --- D-theory --- is proposed, in which continuous classical fields are replaced by discrete quantized variables which undergo dimensional reduction. The 2-d classical O(3) model…

We introduce a new numerical algorithm based on semidefinite programming to efficiently compute bounds on operator dimensions, central charges, and OPE coefficients in 4D conformal and N=1 superconformal field theories. Using our algorithm,…

Let $X$ be a Banach space with a basis $(e_k)_k$ and biorthogonals $(e^\ast_k)_k$. An operator on $X$ is said to have a $\textit {large diagonal}$ if $\inf\limits_{k} |e_k^\ast(T(e_k))| > 0$. The basis $(e_k)_k$ is said to have the $\textit…

We here show that the family of finite-dimensional, discrete-time, passive, linear time-invariant systems can be characterized through the structure of maximal, matrix-convex set, closed under multiplication among its elements. Moreover,…

This paper proposes an efficient FDTD technique for determining electromagnetic fields interacting with a finite-sized 2D and 3D periodic structures. The technique combines periodic boundary conditions---modelling fields away from the edges…

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

A finite element methodology for large classes of variational boundary value problems is defined which involves discretizing two linear operators: (1) the differential operator defining the spatial boundary value problem; and (2) a Riesz…

The infinite reduction of couplings is a tool to consistently renormalize a wide class of non-renormalizable theories with a reduced, eventually finite, set of independent couplings, and classify the non-renormalizable interactions. Several…

Let k be a field of positive characteristic. We construct, for each dominant coweight \lambda of the standard maximal torus in the special linear group, a closed subvariety D(\lambda) of the multigraded Hilbert scheme of an affine space…