Related papers: One-way multilinear functions of the second order …
We introduce a generalizable approach that combines perturbation method and one-shot transfer learning to solve nonlinear ODEs with a single polynomial term, using Physics-Informed Neural Networks (PINNs). Our method transforms non-linear…
Two sets of mutually commuting $q-$difference operators $x_i$ and $y_j$, $i,j=1, ...,N$ such that $x_i$ and $y_i$ generate a homomorphic image of the $q-$Onsager algebra for each $i$ are introduced. The common polynomial eigenfunctions of…
We suggest a novel approach to polynomial processes solely based on a polynomial action operator. With this approach, we can analyse such processes on general state spaces, going far beyond Banach spaces. Moreover, we can be very flexible…
Intertwining relations for $N$-particle Calogero-like models with internal degrees of freedom are investigated. Starting from the well known Dunkl-Polychronakos operators, we construct new kind of local (without exchange operation)…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We construct a commutative algebra A_z, generated by d algebraically independent q-difference operators acting on variables z_1, z_2,..., z_d, which is diagonalized by the multivariable Askey-Wilson polynomials P_n(z) considered by Gasper…
Discrete circular convolution over $\mathbb{Z}/N\mathbb{Z}$ is a linear operator and can be implemented on quantum hardware within the linear-combination-of-unitaries (LCU) framework. In this work, we make this connection explicit through…
The class of non-commutative hypercomplex number systems (HNS) of 4-dimension constructed by using of non-commutative procedure of Grassman-Clifford doubling of 2-dimensional systems is investigated in the article. All HNS of this class are…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
The paper deals with a formally self-adjoint first order linear differential operator acting on m-columns of complex-valued half-densities over an n-manifold without boundary. We study the distribution of eigenvalues in the elliptic setting…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…
In the fields of statistics, machine learning, image science, and related areas, there is an increasing demand for decentralized collection or storage of large-scale datasets, as well as distributed solution methods. To tackle this…
This contribution presents a hierarchical multigrid approach for the solution of large-scale finite cell problems on both uniform grids and multi-level hp-discretizations. The proposed scheme leverages the hierarchical nature of the basis…
We introduce efficient differentially private (DP) algorithms for several linear algebraic tasks, including solving linear equalities over arbitrary fields, linear inequalities over the reals, and computing affine spans and convex hulls. As…
In this paper we present a novel derivation for an existing node-based algorithm for distributed optimisation termed the primal-dual method of multipliers (PDMM). In contrast to its initial derivation, in this work monotone operator theory…
The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
We show that there is a largely unexplored class of functions (positive polymatroids) that can define proper discrete metrics over pairs of binary vectors and that are fairly tractable to optimize over. By exploiting submodularity, we are…
We study some classes of symmetric operators for the discrete series representations of the quantum algebra U_q(su_{1,1}), which may serve as Hamiltonians of various physical systems. The problem of diagonalization of these operators…