相关论文: Representing the GCD as linear combination in non-…

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$ and let $W_{2}(\mathbb{F}_{q})$ be the ring of Witt vectors of length two over $\mathbb{F}_{q}$. We prove that for any integer $n$ such that $p$ divides $n$, the groups…

We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…

We discuss a conjecture concerning the enumeration of nonsingular matrices over a finite field that are block companion and whose order is the maximum possible in the corresponding general linear group. A special case is proved using some…

Polynomial composites were introduced by Anderson, Anderson, and Zafrullah. Over time, composites have appeared in many different papers, but they have not been sorted out in the algebra world. This paper is another part of the study of…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…

The expression $a^n + b^n$ can be factored as $(a+b)(a^{n-1} - a^{n-2} b + a^{n-3} b^2 - ... + b^{n-1})$ when $n$ is an odd integer greater than one. This paper focuses on proving a few properties of the longer factor above, which we call…

Let $R\ $be an integral domain and $R^{\#}$ the set of all nonzero nonunits of $R.\ $For every elements $a,b\in R^{\#},$ we define $a\sim b$ if and only if $aR=bR,$ that is, $a$ and $b$ are associated elements. Suppose that $EC(R^{\#})$ is…

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…

Let q be a power of a prime and n a positive integer. Let P(q) be a parabolic subgroup of the finite general linear group GL(n,q). We show that the number of P(q)-conjugacy classes in GL(n,q) is, as a function of q, a polynomial in q with…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

For modular indecomposable representations of a cyclic group $G$ of prime order $p$ we propose a list of polynomial invariants of degree $\leq 3$ that, together with a simple invariant of degree $p$, separate generic orbits and generate the…

We provide an irreducibility test and factoring algorithm (with some qualifications) for formal power series in the unique factorization domain $R[[X]]$, where $R$ is any principal ideal domain. We also classify all integral domains arising…

In this paper, we intend to present a new algorithm to factorize large numbers. According to the algorithm proposed here, we prove that there is a common factor between p and q. With this procedure, the time of factorization considerably…

In the case of p-adic general linear groups, each irreducible representation is parabolically induced by a tensor product of irreducible representations supported by cuspidal lines. One gets in this way a parameterization of the irreducible…

Let $p$ be a large prime number. We prove that any integer $\lambda$ modulo $p$ can be represented in the form $$ m!n! +\sum_{i=1}^{47}n_i!\equiv \lambda \pmod p, $$ with $\max\{m,n,n_1,\ldots,n_{47}\}\ll p^{1300/1301}.$ This improves the…

A ring A is called presimplifiable if whenever a; b belongs to A and a = ab, then either a = 0 or b is a unit in A. Let A be a commutative ring and G be an abelian torsion group. For the group ring A[G], we prove that A[G] is…

In this article, we shall generalize a theorem due to Frobenius in group theory, which asserts that if $p$ is a prime and $p^{r}$ divides the order of a finite group, then the number of subgroups of order $p^{r}$ is $\equiv$ 1(mod $p$).…

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too…