Related papers: Six Ways to Implement Divisibility by Three in min…
In this article we develop a numerical scheme to deal with interfaces between touching numerical grids when solving Schr\"o{}dinger equation. In order to pass the information among grids we use the values of the fields only at the contact…
In this paper we give new methods to construct zero divisors in A_n =R^(2^n) the Cayley_Dickson algebras over the real numbers, for n larger than 4, and we also relate the set of zero divisors in A_{n+1} with the Stiefel Manifold V_{2^n…
It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4…
Let $M$ be a connected, closed, oriented three-manifold and $K$, $L$ two rationally null-homologous oriented simple closed curves in $M$. We give an explicit algorithm for computing the linking number between $K$ and $L$ in terms of a…
We study lower bounds on the worst-case error of numerical integration in tensor product spaces. As reference we use the $N$-th minimal error of linear rules that use $N$ function values. The information complexity is the minimal number $N$…
Let $b(n)$ be the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ consists of distinct odd parts, and $\pi_2$ and $\pi_3$ consist of parts divisible by $4$. Utilizing modular forms, Lin obtained the generating…
For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…
Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…
This paper provides algebraic proofs for several types of congruences involving the multipartition function and self-convolutions of the divisor function. Our computations use methods of Differential Algebra in $\mathbb{Z}/q\mathbb{Z}$,…
Via a multidimensional complementarity relation we derive a novel operational entanglement measure for any discrete quantum system, i.e. for any multidimensional and multipartite system. This new measure admits a separation into different…
This paper detailedly discusses the locally one-dimensional numerical methods for efficiently solving the three-dimensional fractional partial differential equations, including fractional advection diffusion equation and Riesz fractional…
In this paper, we investigate the arithmetic properties of the difference between the number of partitions of a positive integer $n$ with even crank and those with odd crank, denoted $C(n)=c_e(n)-c_o(n)$. Inspired by Ramanujan's classical…
Lexicographically minimal string rotation is a fundamental problem in string processing that has recently garnered significant attention in quantum computing. Near-optimal quantum algorithms have been proposed for solving this problem,…
In this study, we employ Euler's method and Richardson's extrapolation to solve a triple integral, which is then transformed into a third-order initial value problem. Our objective is to resolve the computational challenges associated with…
The min-knapsack problem with compactness constraints extends the classical knapsack problem, in the case of ordered items, by introducing a restriction ensuring that they cannot be too far apart. This problem has applications in…
3D action recognition was shown to benefit from a covariance representation of the input data (joint 3D positions). A kernel machine feed with such feature is an effective paradigm for 3D action recognition, yielding state-of-the-art…
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…
Feynman integral reduction by means of integration-by-parts identities is a major power gadget in a theorist toolbox indispensable for calculation of multiloop quantum effects relevant for particle phenomenology and formal theory alike. An…
In this paper, two approximation algorithms are given. Let N be an odd composite number. The algorithms give new directions regarding primality test of given N. The first algorithm is given using a new method called digital coding method.…
We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition…