Related papers: Characterization algorithms for shift radix system…
The aim of this paper is to study the basic properties of the Thompson metric $d_T$ in the general case of a real linear space $X$ ordered by a cone $K$. We show that $d_T$ has monotonicity properties which make it compatible with the…
A $D>2$ topological string is presented by coupling the $2d$ topological gravity with the twisted version of the $N=2$ superconformal matter with $c=3k/(k-2)$. The latter is shown to admit $k+1$ chiral primary fields from the…
The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether…
We study neutral functional differential equations with stable linear non-autonomous $D$-operator. The operator of convolution $\hat{D}$ transforms $BU$ into $BU$. We show that, if $D$ is stable, then $\hat{D}$ is invertible and, besides,…
In our previous works we proved a finiteness property of the radii of convergence functions associated with a vector bundle with connection on $p$-adic analytic curves. We showed that the radii are locally constant functions outside a…
For systems of evolutionary partial differential equations the tau-structure is an important notion which originated from the deep relation between integrable systems and quantum field theories. We show that, under a certain non-degeneracy…
We investigate a density-functional theory (DFT) approach for an unpolarized trapped dilute Fermi gas in the unitary limit . A reformulation of the recent work of T. Papenbrock [Phys. Rev. A, {\bf 72}, 041602(R) (2005)] in the language of…
Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…
An ordered structure is called o-minimalistic if it has all the first-order features of an o-minimal structure. We propose a theory, DCTC (Definable Completeness/Type Completeness), that describes many properties of o-minimalistic…
Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…
We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…
Cutwidth is one of the classic layout parameters for graphs. It measures how well one can order the vertices of a graph in a linear manner, so that the maximum number of edges between any prefix and its complement suffix is minimized. As…
We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…
We present a new duality between the F-terms of supersymmetric field theories defined in two- and four-dimensions respectively. The duality relates N=2 supersymmetric gauge theories in four dimensions, deformed by an Omega-background in one…
We show that the VC-dimension of a graph can be computed in time $n^{\log d+1} d^{O(d)}$, where $d$ is the degeneracy of the input graph. The core idea of our algorithm is a data structure to efficiently query the number of vertices that…
The proposed article aims at offering a comprehensive tutorial for the computational aspects of structured matrix and tensor factorization. Unlike existing tutorials that mainly focus on {\it algorithmic procedures} for a small set of…
Every simple finite graph $G$ has an associated Lov\'asz-Saks-Schrijver ring $R_G(d)$ that is related to the $d$-dimensional orthogonal representations of $G$. The study of $R_G(d)$ lies at the intersection between algebraic geometry,…
The influence of networks topology on collective properties of dynamical systems defined upon it is studied in the thermodynamic limit. A network model construction scheme is proposed where the number of links, the average eccentricity and…
We show that training deep neural networks (DNNs) with absolute value activation and arbitrary input dimension can be formulated as equivalent convex Lasso problems with novel features expressed using geometric algebra. This formulation…
We consider the simplest gauge theories given by one- and two- matrix integrals and concentrate on their stringy and geometric properties. We remind general integrable structure behind the matrix integrals and turn to the geometric…