相关论文: On the Characterization of $\tau_{(n)}$-Atoms

The theory of $\tau$-factorizations on integral domains was developed by Anderson and Frazier. This theory characterized all the known factorizations and opened the opportunity to create new ones. It can be visualized as a restriction to…

For an element $a$ of an integral domain D under an equivalence relation \tau, the \tau-factorization of a is defined as \lambda a_1 a_2... a_k, where \lambda is a unit in D and a_i \tau a_j for all i, j. An irreducible element has no…

For a commutative domain $R$ with nonzero identity and $I$ an ideal of $R$, we say $a=\lambda b_1 \cdots b_k$ is a $\tau_I$-factorization of $a$ if $\lambda \in R$ is a unit and $b_i \equiv b_j$(mod $I$) for all $1\leq i \leq j \leq k$.…

New algorithms for prime factorization that outperform the existing ones or take advantage of particular properties of the prime factors can have a practical impact on present implementations of cryptographic algorithms that rely on the…

Factorization is the most fundamental way to determine if a number $n$ is prime or composite. Yet, this approach becomes impracticable when considering large values of $n$, a difficulty that is exploited by cryptographic protocols. We…

In this paper, we study factorizations in the additive monoids of positive algebraic valuations $\mathbb{N}_0[\alpha]$ of the semiring of polynomials $\mathbb{N}_0[X]$ using a methodology introduced by D. D. Anderson, D. F. Anderson, and M.…

Finding a minimal factorization for a generic semigroup can be done by using the Froidure-Pin Algorithm, which is not feasible for semigroups of large sizes. On the other hand, if we restrict our attention to just a particular semigroup, we…

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

We study the factorization of the numbers $N = X^2+c$, where $c$ is a fixed constant, and this independently of the value of gcd$(X,c)$. We prove the existence of a family of sequences with arithmetic difference $(U_n, Z_n)$ generating…

Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…

Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…

Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in approximately half of the traps being filled. To consolidate…

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

An integral domain is atomic if every nonzero nonunit factors into irreducibles. Let $R$ be an integral domain. We say that $R$ is a bounded factorization domain if it is atomic and for every nonzero nonunit $x \in R$, there is a positive…

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…

We estimate the number $|\mathcal{A}_{\boldsymbol\lambda}|$ of elements on a nonlinear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $r$ having factorization pattern…

Much work has been done on generalized factorization techniques in integral domains, namely $\tau$-factorization. There has also been substantial progress made in investigating factorization in commutative rings with zero-divisors. There…

The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of…

In an additive factorial monoid each element can be represented as a linear combination of irreducible elements (atoms) with uniquely determined coefficients running over all natural numbers. In this paper we develop for a wide class of…