相关论文: A new algorithm for computing idempotents of R-tri…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

We consider algorithms for going from a "full" matrix to a condensed "band bidiagonal" form using orthogonal transformations. We use the framework of "algorithms by tiles". Within this framework, we study: (i) the tiled bidiagonalization…

This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…

In this article, we prove some results for lower nil M-Armendariz ring. Let M be a strictly totally ordered monoid and I be a semicommutative ideal of R. If R/I is a lower nil M-Armendariz ring, then R is lower nil M-Armendariz. Similarly,…

Let R be a finite principal left ideal ring. Via a total ordering of the ring elements and an ordered basis a lexicographic ordering of the module R^n is produced. This is used to set up a greedy algorithm that selects vectors for which all…

We study the arithmetic of seminormal $v$-noetherian weakly Krull monoids with nontrivial conductor which have finite class group and prime divisors in all classes. These monoids include seminormal orders in holomorphy rings in global…

Let R be a (unital) commutative ring, and G be a finite group with order invertible in R. We introduce new idempotents in the double Burnside algebra RB(G,G), indexed by conjugacy classes of minimal sections of G, i.e. pairs (T,S) of…

We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…

We give an explicit and character-free construction of a complete set of orthogonal primitive idempotents of a rational group algebra of a finite nilpotent group and a full description of the Wedderburn decomposition of such algebras. An…

Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…

These notes present an approach to obtaining the basic operations of addition and multiplication on the natural numbers in terms of elementary results about commutative monoids.

In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of…

Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a quantum algorithm of Arvind et al.…

We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…

We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…

In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of…

Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of…

In this paper we give an explicit description of primitive central idempotents of rational group algebras of finite abelian groups using long presentation, and determine their Wedderburn decompositions.

In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…

Right-reversing is an algorithm used to compute least common multiples in monoids that admit a right-complemented presentation. The algorithm can either terminate and find a result, fail, or run indefinitely. The correctness of the…