Related papers: One-way multilinear functions of the second order …
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…
We present an algorithm for the analytical evaluation of dimensionally regularized massless on-shell double box Feynman diagrams with arbitrary polynomials in numerators and general integer powers of propagators. Recurrence relations…
This paper establishes the iteration-complexity of a Jacobi-type non-Euclidean proximal alternating direction method of multipliers (ADMM) for solving multi-block linearly constrained nonconvex programs. The subproblems of this ADMM variant…
In differential geometry, the notation d^n f along with the corresponding formalism has fallen into disuse since the birth of exterior calculus. However, differentials of higher order are useful objects that can be interpreted in terms of…
In this survey, we describe a general key exchange protocol based on semidirect product of (semi)groups (more specifically, on extensions of (semi)groups by automorphisms), and then focus on practical instances of this general idea. This…
We propose a variant of alternating direction method of multiplier (ADMM) to solve constrained trajectory optimization problems. Our ADMM framework breaks a joint optimization into small sub-problems, leading to a low iteration cost and…
We give an efficient algorithm for learning a binary function in a given class C of bounded VC dimension, with training data distributed according to P and test data according to Q, where P and Q may be arbitrary distributions over X. This…
We design a class of Chudnovsky-type algorithms multiplying k elements of a finite extension of order n a finite field K. We prove that these algorithms give a tensor decomposition of the k-multiplication for which the rank is linear in n…
We represent an algorithm allowing one to construct new classes of partially integrable multidimensional nonlinear partial differential equations (PDEs) starting with the special type of solutions to the (1+1)-dimensional hierarchy of…
For continuous-time dynamical systems with reversible trajectories, the nowhere-vanishing eigenfunctions of the Koopman operator of the system form a multiplicative group. Here, we exploit this property to accelerate the systematic…
Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor polynomial time algorithm for numerical field problems like…
It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…
This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
The Dunkl operators associated to a dihedral group are a pair of differential-difference operators that generate a commutative algebra acting on differentiable functions in $\mathbb{R}^2$. The intertwining operator intertwines between this…
We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…
We exploit the key idea that nonlinear system identification is equivalent to linear identification of the socalled Koopman operator. Instead of considering nonlinear system identification in the state space, we obtain a novel linear…
We extend a primal-dual fixed point algorithm (PDFP) proposed in [5] to solve two kinds of separable multi-block minimization problems, arising in signal processing and imaging science. This work shows the flexibility of applying PDFP…
This paper presents a novel method of global adaptive dynamic programming (ADP) for the adaptive optimal control of nonlinear polynomial systems. The strategy consists of relaxing the problem of solving the Hamilton-Jacobi-Bellman (HJB)…
Adomian polynomials (AP's) are expressed in terms of new objects called reduced polynomials (RP's). These new objects, which carry two subscripts, are independent of the form of the nonlinear operator. Apart from the well-known two…