Related papers: An extension of the digital method based on $b$-ad…

In this paper, we analyze properties of prime number sequences produced by the alternating sum of higher-order subsequences of the primes. We also introduce a new sieve which will generate these prime number sequences via the systematic…

Using three coupled harmonic oscillators, we present an amplitude-amplification method for factorization of an integer. We generalize the method in [arXiv:1007.4338] by employing non-orthogonal measurements on the harmonic oscillator. This…

In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…

We develop a numerical method for solving a system of nonlinear integral equations involving two integral terms: at the current time t, one integral is taken from 0 to t, and a different integral is taken from t to infinity. We prove the…

The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…

Data augmentation is an important facilitator of deep learning applications in the time series domain. A gap is identified in the literature, demonstrating sparse exploration of the transformer, the dominant sequence model, for data…

We provide a real algebraic symbolic-numeric algorithm for computing the real variety $V_R(I)$ of an ideal $I$, assuming it is finite while $V_C(I)$ may not be. Our approach uses sets of linear functionals on $R[X]$, vanishing on a given…

We consider redundant binary joint digital expansions of integer vectors. The redundancy is used to minimize the Hamming weight, i.e., the number of nonzero digit vectors. This leads to efficient linear combination algorithms in abelian…

The binary radix expansion of a real number can be used to code the outcome of any series of coin tosses, a fact that provides an intriguing link between number theory, measure theory and statistical physics. Inspired by this fact, a…

The solution of a generalized impurity model lies at the heart of electronic structure calculations with dynamical mean-field theory (DMFT). In the strongly-correlated regime, the method of choice for solving the impurity model is the…

We propose a general algorithmic framework for constrained matrix and tensor factorization, which is widely used in signal processing and machine learning. The new framework is a hybrid between alternating optimization (AO) and the…

We consider linear systems $Ax = b$ where $A \in \mathbb{R}^{m \times n}$ consists of normalized rows, $\|a_i\|_{\ell^2} = 1$, and where up to $\beta m$ entries of $b$ have been corrupted (possibly by arbitrarily large numbers). Haddock,…

The homogenization of one-dimensional acoustic or elastic structures of finite extent is considered. A new homogenization method based on transfer matrices is derived. The new homogenization method may account for variable cross sectional…

We present a general scheme for the construction of new eficient generalized Schultz iterative methods for computing the inverse matrix. These methods have the form $$ X_{k+1} = X_k(a_0^{(k)}I+a_1^{(k)}AX_k),\quad k\in\mathbb{N}, $$ where…

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…

In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural…

We propose a novel Metropolis-Hastings algorithm to sample uniformly from the space of correlation matrices. Existing methods in the literature are based on elaborated representations of a correlation matrix, or on complex parametrizations…

We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…

Unsupervised clustering of temporal data is both challenging and crucial in machine learning. In this paper, we show that neither traditional clustering methods, time series specific or even deep learning-based alternatives generalise well…

We present efficient algorithms to generate a bit string in which each bit is set with arbitrary probability. By adopting a hybrid algorithm, i.e., a finite-bit density approximation with correction techniques, we achieve 3.8 times faster…