English
Related papers

Related papers: On Composite Moduli from the Viewpoint of Idempote…

200 papers

This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…

Number Theory · Mathematics 2010-01-21 Xavier Taixes i Ventosa , Gabor Wiese

Our aim is to transfer several foundational results from the modular representation theory of finite groups to the wider context of profinite groups. We are thus interested in profinite modules over the completed group algebra k[[G]] of a…

Representation Theory · Mathematics 2010-11-15 John MacQuarrie

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…

Number Theory · Mathematics 2023-09-04 Zubeyir Cinkir , Aysegul Ozturkalan

Given a local ring containing a field, we define and investigate a family of invariants that includes the Lyubeznik numbers, but that captures finer information. These "generalized Lyubeznik numbers" are defined as lengths of certain…

Commutative Algebra · Mathematics 2012-10-24 Luis Núñez-Betancourt , Emily E. Witt

A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…

Data Structures and Algorithms · Computer Science 2007-11-20 Binh-Minh Bui-Xuan , Michel Habib , Vincent Limouzy , Fabien De Montgolfier

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

Computational Complexity · Computer Science 2009-12-31 Marco Pedicini , Mario Piazza

Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and…

Artificial Intelligence · Computer Science 2013-04-11 Yizong Cheng , Rangasami L. Kashyap

In this paper we provide concrete constructions of idempotents to represent typical singular matrices over a given ring as a product of idempotents and apply these factorizations for proving our main results. We generalize works due to…

Rings and Algebras · Mathematics 2013-02-05 Adel Alahmadi , Surender Jain , André Leroy

We define a formal framework for the study of algebras of type Max-plus, Min-Plus, tropical algebras, and more generally algebras over a commutative idempotent semi-field. This work is motivated by the increasingly diversified use of these…

Commutative Algebra · Mathematics 2008-07-22 Dominique Castella

Let $k$ be a unital commutative ring. In this paper, we study polynomial functors from the category of finitely generated free nilpotent groups to the category of $k$-modules, focusing on comparisons across different nilpotency classes and…

Algebraic Topology · Mathematics 2026-01-01 Minkyu Kim

Recently, we have endowed various categories of groups with topologies. The purpose of this paper is to introduce on these categories others topologies which are statistically more suitable to study well-known problems in groups theory. We…

Algebraic Geometry · Mathematics 2013-02-14 Tsemo Aristide

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

In this paper we give Kummer's original type congruence relation modulo a prime power for the universal Bernoulli numbers. Although the index of the power is half of original congruence, this estimate is best possible.

Number Theory · Mathematics 2007-05-23 Yoshihiro Ônishi

The notion of singular reduction modules, i.e., of singular modules of nonclassical (conditional) symmetry, of differential equations is introduced. It is shown that the derivation of nonclassical symmetries for differential equations can…

Mathematical Physics · Physics 2017-12-05 Vaycheslav M. Boyko , Michael Kunzinger , Roman O. Popovych

We investigate properties of varieties of algebras described by a novel concept of equation that we call \emph{commutator equation}. A commutator equation is a relaxation of the standard term equality obtained substituting the equality…

Rings and Algebras · Mathematics 2023-10-04 Stefano Fioravanti

E26 in the Enestrom index. Translated from the Latin original, "Observationes de theoremate quodam Fermatiano aliisque ad numeros primos spectantibus" (1732). In this paper Euler gives a counterexample to Fermat's claim that all numbers of…

History and Overview · Mathematics 2008-04-15 Leonhard Euler

We introduce a notion of strong periodicity of a module over a finite-dimensional algebra over a field. We prove that the existence of such modules over certain idempotent algebras is both a necessary and sufficient condition for the…

Representation Theory · Mathematics 2025-01-16 Alfred Dabson

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…

Commutative Algebra · Mathematics 2016-10-05 H. W. Lenstra , A. Silverberg

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan