Related papers: Multiple addition, deletion and restriction theore…
In this paper, we generalize the method of using two parallel versions of the lifted MRD code from the existing work [1]. The Delsarte theorem of the rank distribution of MRD codes is an important part to count codewords in our…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
For the last ten years, almost every theoretical result concerning the expected run time of a randomized search heuristic used drift theory, making it the arguably most important tool in this domain. Its success is due to its ease of use…
We present an Augmented Lagrangian formulation and its real-space implementation for non-periodic orbital-free Density Functional Theory (OF-DFT) calculations. In particular, we rewrite the constrained minimization problem of OF-DFT as a…
We study a new model theory for formal mathematical systems that we developed in a previous paper. We introduce isomorphic and homomorphic structures for formal languages, present some results and examples and conclude our paper with a…
We investigate the implications of free probability for random matrices. From rules for calculating all possible joint moments of two free random matrices, we develop a notion of partial freeness which is quantified by the breakdown of…
Maximizing monotone submodular functions under a matroid constraint is a classic algorithmic problem with multiple applications in data mining and machine learning. We study this classic problem in the fully dynamic setting, where elements…
Number theoretic transform (NTT) is the most efficient method for multiplying two polynomials of high degree with integer coefficients, due to its series of advantages in terms of algorithm and implementation, and is consequently…
Let A be a generic hyperplane arrangement composed of r hyperplanes in an n-dimensional vector space, and S the polynomial ring in n variables. We consider the S-submodule D(m)(A) of the nth Weyl algebra of homogeneous differential…
Chinese Remainder Theorem (CRT) is a powerful approach to solve ambiguity resolution related problems such as undersampling frequency estimation and phase unwrapping which are widely applied in localization. Recently, the deterministic…
Multi-tildes are regular operators that were introduced to enhance the factorization power of regular expressions, allowing us to add the empty word in several factors of a catenation product of languages. In addition to multi-bars, which…
The Ziegler-Rauk-Baerends multiplet sum method (MSM) assumes that density-functional theory (DFT) provides a good description of states dominated by a single determinant. It then uses symmetry to add static correlation to DFT. In our…
Saito's criterion is a foundational result that algebraically characterizes free hyperplane arrangements via the determinant of a square matrix of logarithmic derivations. It is natural to ask whether this criterion can be generalized to…
Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: the lack of…
We derive two consequences of the multivariate fundamental theorem of algebra (MFTA). The first one is the Bezout theorem for $n$ polynomials. Notably the intersection multiplicities, as in MFTA, are characterized just by means of partial…
Since the invention of space-time coding numerous algebraic methods have been applied in code design. In particular algebraic number theory and central simple algebras have been on the forefront of the research. In this paper we are turning…
We prove results concerning the behavior of Hodge ideals under restriction to hypersurfaces or fibers of morphisms, and addition. The main tool is the description of restriction functors for mixed Hodge modules by means of the…
Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and…
Given a frame in a finite dimensional Hilbert space we construct additive perturbations which decrease the condition number of the frame. By iterating this perturbation, we introduce an algorithm that produces a tight frame in a finite…
In this paper, we show how to compute using Fitting ideals the nonfree locus of the moduli space of arrangements of a rank $3$ simple matroid, i.e., the subset of all points of the moduli space which parametrize nonfree arrangements. Our…