Related papers: Prime Factorization in Models of PV$_1$

Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…

We study the non-uniqueness of factorizations of non zero-divisors into atoms (irreducibles) in noncommutative rings. To do so, we extend concepts from the commutative theory of non-unique factorizations to a noncommutative setting. Several…

One of the greatest difficulties encountered by all in their first proof intensive class is subtly assuming an unproven fact in a proof. The purpose of this note is to describe a specific instance where this can occur, namely in results…

Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

For a given m>=1, we consider the finite non-abelian groups G for which |C_G(g):<g>|<=m for every g in G\Z(G). We show that the order of G can be bounded in terms of m and the largest prime divisor of the order of G. Our approach relies on…

We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gr\"obner bases. We present a novel scalable algorithm which combines the two approaches and leads to the…

We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…

We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate…

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…

Let $a_0\in\{0,\dots,9\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their decimal expansion. The proof is an application of the Hardy-Littlewood circle method to a binary problem, and rests on…

Let $g$ be sufficiently large, $b\in\{0,\ldots,g-1\}$, and $\mathcal{S}_b$ be the set of integers with no digit equal to $b$ in their base $g$ expansion. We prove that every sufficiently large odd integer $N$ can be written as $p_1 + p_2 +…

Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which…

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

We give sufficient conditions, in terms of the existence of unbounded derivations satisfying certain properties, which ensure that a II$_1$ factor $M$ is prime or has at most one Cartan subalgebra. For instance, we prove that if there…

We generalize the theory of radical factorization from almost Dedekind domain to strongly discrete Pr\"ufer domains; we show that, for a fixed subset $X$ of maximal ideals, the finitely generated ideals with $\mathcal{V}(I)\subseteq X$ have…