Related papers: On an efficient induction step with Nklt(X,D)
The problem of space-efficient depth-first search (DFS) is reconsidered. A particularly simple and fast algorithm is presented that, on a directed or undirected input graph $G=(V,E)$ with $n$ vertices and $m$ edges, carries out a DFS in…
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have been proposed in the past for determining bucket boundaries…
We develop a generalization of Nesterov's accelerated gradient descent method which is designed to deal with orthogonality constraints. To demonstrate the effectiveness of our method, we perform numerical experiments which demonstrate that…
We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…
We describe a new algorithm for computing the Voronoi diagram of a set of $n$ points in constant-dimensional Euclidean space. The running time of our algorithm is $O(f \log n \log \Delta)$ where $f$ is the output complexity of the Voronoi…
This paper aims to maximize optical force and torque on arbitrary micro- and nano-scale objects using numerically optimized structured illumination. By developing a numerical framework for computer-automated design of 3d vector-field…
We prove the rationality of the descendent partition function for stable pairs on nonsingular toric 3-folds. The method uses a geometric reduction of the 2- and 3-leg descendent vertices to the 1-leg case. As a consequence, we prove the…
Recently, Peter Doyle and Curt McMullen devised an iterative solution to the fifth degree polynomial. At the method's core is a rational mapping of the Riemann sphere with the icosahedral symmetry of a general quintic. Moreover, this map…
A new approach for the reduction of tensor integrals is described. The standard decomposition \`{a} la Davydychev is applied. Integrals with higher indices are then expressed in terms of scalar higher-dimensional integrals with generic…
Recently, there has been a lot of research into tensor singular value decomposition (t-SVD) by using discrete Fourier transform (DFT) matrix. The main aims of this paper are to propose and study tensor singular value decomposition based on…
The overlap Dirac operator at nonzero quark chemical potential involves the computation of the sign function of a non-Hermitian matrix. In this talk we present an iterative method, first proposed by us in Ref. [1], which allows for an…
New techniques for imaging electromagnetic near-fields in nanostructures drive advancements in nanotechnology, optoelectronics, materials science, and biochemistry. Most existing techniques probe near-fields along surfaces, lacking the…
We show that an n-dimensional compactum X embeds in R^m, where m>3(n+1)/2, if and only if X x X - \Delta admits an equivariant map to S^{m-1}. In particular, X embeds in R^{2n}, n>3, iff the top power of the (twisted) Euler class of the…
We revisit the inductive matrix completion problem that aims to recover a rank-$r$ matrix with ambient dimension $d$ given $n$ features as the side prior information. The goal is to make use of the known $n$ features to reduce sample and…
The N-dimensional Hamiltonian H formed by a curved kinetic term (depending on a function f), a central potential (depending on a function U), a Dirac monopole term, and N centrifugal terms is shown to be quasi-maximally superintegrable for…
Topological techniques are powerful tools for characterizing the complexity of many dynamical systems, including the commonly studied area-preserving maps of the plane. However, the extension of many topological techniques to higher…
We propose a variational framework that interprets transformer layers as iterations of an optimization algorithm acting on token embeddings. In this view, self-attention implements a gradient step of an interaction energy, while MLP layers…
In a Hilbert setting, we develop fast methods for convex unconstrained optimization. We rely on the asymptotic behavior of an inertial system combining geometric damping with temporal scaling. The convex function to minimize enters the…
Invariant integration of vectors and tensors over manifolds was introduced around fifty years ago by V.N. Folomeshkin, though the concept has not attracted much attention among researchers. Although it is a sophisticated concept, the…
We view closed orientable 3-manifolds as covers of S^3 branched over hyperbolic links. For a p-fold cover M \to S^3, branched over a hyperbolic link L, we assign the complexity p Vol(S^3 minus L) (where Vol is the hyperbolic volume). We…