Related papers: On an efficient induction step with Nklt(X,D)
Dense 3D convolutions provide high accuracy for perception but are too computationally expensive for real-time robotic systems. Existing tri-plane methods rely on 2D image features with interpolation, point-wise queries, and implicit MLPs,…
We study Voronoi diagrams for distance functions that add together two convex functions, each taking as its argument the difference between Cartesian coordinates of two planar points. When the functions do not grow too quickly, then the…
We prove that for any compact orientable connected 3-manifold with torus boundary, a concatenation of it and the direct product of the circle and the Klein bottle with an open 2-disk removed admits a Lagrangian embedding into the standard…
We show that the complex projective space has maximal degree (volume) among all n-dimensional Kahler-Einstein Fano manifolds admitting a holomorphic C^*-action with a finite number of fixed points. The toric version of this result,…
We conjecture an upper bound on the growth of the Yokota invariant of polyhedral graphs, extending a previous result on the growth of the $6j$-symbol. Using Barrett's Fourier transform we are able to prove this conjecture in a large family…
Linear complexity iterative and log-linear complexity direct solvers are developed for the volume integral equation (VIE) based general large-scale electrodynamic analysis. The dense VIE system matrix is first represented by a new…
The computation of Voronoi Diagrams, or their dual Delauney triangulations is difficult in high dimensions. In a recent publication Polianskii and Pokorny propose an iterative randomized algorithm facilitating the approximation of Voronoi…
We prove some classification results for tight contact structure in the 3-space, -ball and -sphere that are invariant with respect to some arbitrary involution, that is conjugated to the standard rotation around the x-axis. Unlike the…
Given a general plane curve Y of degree d, we compute the number n_d of irreducible plane conics that are 5-fold tangent to Y. This problem has been studied before by Vainsencher using classical methods, but it could not be solved there…
We provide a formula for the partition function of five-dimensional $\mathcal{N}=1$ gauge theories on $\mathcal{M}_4 \times S^1$, topologically twisted along $\mathcal{M}_4$ in the presence of general background magnetic fluxes, where…
For projectivizations of rational maps Bellon and Viallet defined the notion of algebraic entropy using the exponential growth rate of the degrees of iterates. We want to call this notion to the attention of dynamicists by computing…
For the approximation and simulation of twofold iterated stochastic integrals and the corresponding L\'{e}vy areas w.r.t. a multi-dimensional Wiener process, we review four algorithms based on a Fourier series approach. Especially, the very…
An arithmetic method of proving the irrationality of smooth projective 3-folds is described, using reduction modulo $p$. It is illustrated by an application to a cubic threefold, for which the hypothesis that its intermediate Jacobian is…
A novel inline data compression method is presented for single-precision vectors in three dimensions. The primary application of the method is for accelerating computational physics calculations where the throughput is bound by memory…
We investigate the combinatorial analogues, in the context of normal surfaces, of taut and transversely measured (codimension 1) foliations of 3-manifolds. We establish that the existence of certain combinatorial structures, a priori weaker…
Randomized-subspace methods reduce the cost of first-order optimization by using only low-dimensional projected-gradient information, a feature that is attractive in forward-mode automatic differentiation and communication-limited settings.…
Motivated by M-theory, we study rank n K-theoretic Donaldson-Thomas theory on a toric threefold X. In the presence of compact four-cycles, we discuss how to include the contribution of D4-branes wrapping them. Combining this with a simple…
A method is presented for forming polynomial interpolants on squares and cubes, which are more efficient in the so-called Euclidean degree than other commonly used methods with the same number of collocation points. These methods have…
We prove the factoriality of the following nodal threefolds: a complete intersection of hypersurfaces $F$ and $G\subset\mathbb{P}^{5}$ of degree $n$ and $k$ respectively, where $G$ is smooth, $|\mathrm{Sing}(F\cap…
In this paper, we present an interior point algorithm with a full-Newton step for solving a linearly constrained convex optimization problem, in which we propose a generalization of the work of Kheirfam and Nasrollahi…