Related papers: A Combinatorial Algorithm for Computing Higher Ord…
Minimizing the discrepancy of feature distributions between different domains is one of the most promising directions in unsupervised domain adaptation. From the perspective of distribution matching, most existing discrepancy-based methods…
We propose a new method for the evaluation of intersection numbers for twisted meromorphic $n$-forms, through Stokes' theorem in $n$ dimensions. It is based on the solution of an $n$-th order partial differential equation and on the…
High-performance Ising machines for solving combinatorial optimization problems have been developed with digital processors implementing heuristic algorithms such as simulated bifurcation (SB). Although Ising machines have been designed for…
In this work, building up on [1] we present momentum space Ward identities related to broken higher spin symmetry as an alternate approach to computing correlators of spinning operators in interacting theories such as the quasi-fermionic…
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which…
Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…
It is commonly assumed that calculating third order information is too expensive for most applications. But we show that the directional derivative of the Hessian ($D^3f(x)\cdot d$) can be calculated at a cost proportional to that of a…
We study numerical integration of smooth functions defined over the $s$-dimensional unit cube. A recent work by Dick et al. (2019) has introduced so-called extrapolated polynomial lattice rules, which achieve the almost optimal rate of…
We present a collection of new results on problems related to 3SUM, including: 1. The first truly subquadratic algorithm for $\ \ \ \ \ $ 1a. computing the (min,+) convolution for monotone increasing sequences with integer values bounded by…
J.H.C. Whitehead introduced the concept of crossed modules in the early 20th century. These crossed modules are crucial for algebraic models of 2-type homotopy, which involve connected spaces with no higher than second-degree homotopy…
This is an expository version of our paper [arXiv:1902.07384]. Our aim is to present recent Macaulay2 algorithms for computation of mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over…
We introduce the new concept of computation coding. Similar to how rate-distortion theory is concerned with the lossy compression of data, computation coding deals with the lossy computation of functions. Particularizing to linear…
This paper presents a new distributed computational model of distributed systems called the phase web that extends V. Pratt's orthocurrence relation from 1986. The model uses mutual-exclusion to express sequence, and a new kind of hierarchy…
Exploiting higher-order derivatives in convex optimization is known at least since 1970's. In each iteration higher-order (also called tensor) methods minimize a regularized Taylor expansion of the objective function, which leads to faster…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
We propose a novel sequence prediction method for sequential data capturing node traversals in graphs. Our method builds on a statistical modelling framework that combines multiple higher-order network models into a single multi-order…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
Mixed superposition rules are, in short, a method to describe the general solutions of a time-dependent system of first-order differential equations, a so-called Lie system, in terms of particular solutions of other ones. This article is…
The linking number is the simplest link invariant given by Gauss; it is the first Gauss diagram formula expressed by one arrow among two circles. Proceeding the next stage, we study the second Gauss diagram formula consisting of two arrows…
A handlebody-link is a disjoint union of embeddings of handlebodies in $S^3$ and an HL-homotopy is an equivalence relation on handlebody-links generated by self-crossing changes. The second author and Ryo Nikkuni classified the set of…