相关论文: An Algorithm to Compute a Primary Decomposition of…

Given a properly normalized parametrization of a genus-0 modular curve, the complex multiplication points map to algebraic numbers called singular moduli. In the classical case, the maps can be given analytically. However, in the Shimura…

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

We address the problem of finding the minimum decomposition of a permutation in terms of transpositions with non-uniform cost. For arbitrary non-negative cost functions, we describe polynomial-time, constant-approximation decomposition…

All rings are commutative with $1\neq0$, and all modules are unital. The purpose of this paper is to investigate the concept of $2$-absorbing primary submodules generalizing $2$-absorbing primary ideals of rings. Let $M$ be an $R$-module. A…

We have introduced the Janet's algorithm for the Stanley decomposition of a monomial ideal I in a polynomial ring S = K[x_1,...,x_n] and prove that Janet's algorithm gives the squarefree Stanley decomposition of S/I for a squarefree…

An \emph{indexing} of a finite set $S$ is a bijection $D : \{1,...,|S|\} \rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$ that is decodable in polynomial time on the size of $N$, given the factorization of…

The paper studies modular reduction techniques for abstract regular and chiral polytopes, with two purposes in mind: first, to survey the literature about modular reduction in polytopes; and second, to apply modular reduction, with moduli…

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…

We first propose a concise singular value decomposition of dual matrices. Then, the randomized version of the decomposition is presented. It can significantly reduce the computational cost while maintaining the similar accuracy. We analyze…

Submodular functions are at the core of many machine learning and data mining tasks. The underlying submodular functions for many of these tasks are decomposable, i.e., they are sum of several simple submodular functions. In many data…

In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish…

We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…

We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for, parametric optimization. The idea is to first consider the variable x1 as a parameter and solve the…

We study the problem of decomposing (i.e. partitioning and covering) polygons into components that are $\alpha$-fat, which means that the aspect ratio of each subpolygon is at most $\alpha$. We consider decompositions without Steiner…

In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called $Z$-separating re-embeddings. Given an ideal $I$ in the polynomial ring $K[x_1,\dots,x_n]$ over a field $K$,…

Discrete empirical interpolation method (DEIM) is a popular technique for nonlinear model reduction and it has two main ingredients: an interpolating basis that is computed from a collection of snapshots of the solution and a set of indices…

We explore some concepts of module theory that derive from the notion of primeness, such as first modules, and extend them to more general environments. We also provide descriptions of simple left semiartinian rings, left local rings,…

The decomposition matrix of a finite group in prime characteristic p records the multiplicities of its p-modular irreducible representations as composition factors of the reductions modulo p of its irreducible representations in…

For a submodule $N$ of an $R$-module $M$, a unique product of prime ideals in $R$ is assigned, which is called the generalized prime ideal factorization of $N$ in $M$, and denoted as ${\mathcal{P}}_M(N)$. But for a product of prime ideals…

For many algebraic codes the main part of decoding can be reduced to a shift register synthesis problem. In this paper we present an approach for solving generalised shift register problems over skew polynomial rings which occur in error…