Related papers: Prefactor Reduction of the Guruswami-Sudan Interpo…
Rectified Flow (RF) models achieve state-of-the-art generation quality, yet controlling them for precise tasks -- such as semantic editing or blind image recovery -- remains a challenge. Current approaches bifurcate into inversion-based…
To any complex Hadamard matrix H one associates a spin model commuting square, and therefore a hyperfinite subfactor. The standard invariant of this subfactor captures certain "group-like" symmetries of H. To gain some insight, we compute…
We complete the realisation by braided subfactors, announced by Ocneanu, of all SU(3)-modular invariant partition functions previously classified by Gannon.
A Krishnan-Sunder subfactor $R_U \ss R$ of index $k^2$ is constructed from a permutation biunitary matrix $U\in M_p(\mathbb{C})\otimes M_k(\mathbb{C})$, i.e. the entries of $U$ are either 0 or 1 and both $U$ and its block transpose are…
Nonconvex optimization problems are widespread in modern machine learning and data science. We introduce an extrapolation strategy into a class of preconditioned second-order convex splitting algorithms for nonconvex optimization problems.…
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a…
We decode Reed-Solomon codes using soft information provided at the receiver. The Extended Euclidean Algorithm (EEA) is considered as an initial step to obtain an intermediate result. The final decoding result is obtained by interpolating…
A general method for reducing tensor form factors, that appear in one-loop calculations in dimensional regularization, to scalar integrals is presented. The method is an extension of the reduction scheme introduced by Passarino and Veltman…
A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…
Power decoding, or "decoding using virtual interleaving" is a technique for decoding Reed--Solomon codes up to the Sudan radius. Since the method's inception, it has been an open question if it is possible to use this approach to decode up…
We propose an alternative method for collaborative decoding of interleaved Reed-Solomon codes. Simulation results for a concatenated coding scheme using polar codes as inner codes are included.
Estimating camera geometry typically involves solving minimal problems formulated as systems of multivariate polynomial equations, which often pose computational challenges when using existing Gr\"obner-basis or resultant-based methods due…
We consider normalizers of an irreducible inclusion $N\subseteq M$ of $\mathrm{II}_1$ factors. In the infinite index setting an inclusion $uNu^*\subseteq N$ can be strict, forcing us to also investigate the semigroup of one-sided…
The paper introduces the sweeping preconditioner, which is highly efficient for iterative solutions of the variable coefficient Helmholtz equation including very high frequency problems. The first central idea of this novel approach is to…
The classical family of Reed-Solomon codes consist of evaluations of polynomials over the finite field $\mathbb{F}_q$ of degree less than $k$, at $n$ distinct field elements. These are arguably the most widely used and studied codes, as…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/erasure tradeoff factor L=2, which means that an error is…
Using a representation theoretical approach we give an explicit numerical characterization in terms of Kronecker invariants of the subfactor relation between two preinjective (and dually preprojective) Kronecker modules, describing…
In this paper, we introduce a novel explicit family of subcodes of Reed-Solomon (RS) codes that efficiently achieve list decoding capacity with a constant output list size. Our approach builds upon the idea of large linear subcodes of RS…