English
Related papers

Related papers: Exact-$m$-majority terms

200 papers

Our main result states that a finite semiring of order >2 with zero which is not a ring is congruence-simple if and only if it is isomorphic to a `dense' subsemiring of the endomorphism semiring of a finite idempotent commutative monoid. We…

Rings and Algebras · Mathematics 2007-05-23 Jens Zumbrägel

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

Number Theory · Mathematics 2007-05-23 Ken Ono

There is a general notion of the magnitude of an enriched category, defined subject to hypotheses. In topological and geometric contexts, magnitude is already known to be closely related to classical invariants such as Euler characteristic…

Rings and Algebras · Mathematics 2016-01-11 Joseph Chuang , Alastair King , Tom Leinster

The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…

Logic in Computer Science · Computer Science 2022-04-12 Reijo Jaakkola

Let $R$ be a commutative ring with identity. For an $R$-module $M$, the notion of strongly prime submodule of $M$ is defined. It is shown that this notion of prime submodule inherits most of the essential properties of the usual notion of…

Commutative Algebra · Mathematics 2009-12-10 A. R. Naghipour

Let $G = (A \cup B,E)$ be a bipartite graph where the set $A$ consists of agents or main players and the set $B$ consists of jobs or secondary players. Every vertex has a strict ranking of its neighbors. A matching $M$ is popular if for any…

Data Structures and Algorithms · Computer Science 2022-07-13 Telikepalli Kavitha

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the…

Logic · Mathematics 2023-07-12 Samuel Allen Alexander , Arthur Paul Pedersen

We find conditions which guarantee moment (in)determinacy of powers and products of nonnegative random variables. We establish new and general results which are based either on the rate of growth of the moments of a random variable or on…

Probability · Mathematics 2016-01-15 Gwo Dong Lin , Jordan Stoyanov

The practically important classes of equal-input and of monotone Markov matrices are revisited, with special focus on embeddability, infinite divisibility, and mutual relations. Several uniqueness results for the classic Markov embedding…

Probability · Mathematics 2022-09-27 Michael Baake , Jeremy Sumner

In these notes we develop some basic theory of idempotents in monoidal categories. We introduce and study the notion of a pair of complementary idempotents in a triangulated monoidal category, as well as more general idempotent…

Category Theory · Mathematics 2017-03-06 Matthew Hogancamp

Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…

Number Theory · Mathematics 2023-06-06 Jacob Hartzer , Christopher O'Neill

In this paper we study $b_5(n)$, the $5$-regular partitions of $n$. Using the theory of modular forms, we prove several theorems on the divisibility and distribution properties of $b_5(n)$ modulo prime $m\geq5$. In particular, we prove that…

Number Theory · Mathematics 2022-08-04 Qi-Yang Zheng

For a new class of algebras, called $EMV$-algebras, every idempotent element $a$ determines an $MV$-algebra which is important for the structure of the $EMV$-algebra. Therefore, instead of standard homomorphisms of $EMV$-algebras, we…

Commutative Algebra · Mathematics 2017-10-18 Anatolij Dvurečenskij , Omid Zahiri

An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…

Number Theory · Mathematics 2024-06-11 Mihai Prunescu

In (B-Gran, 2004), was given a categorical formulation of the Shifting Lemma which is a characterization of the Congruence Modular Varieties among all the variety of Universal Algebra, introduced in (Gumm, 1983). Starting from a…

Category Theory · Mathematics 2021-03-24 Dominique Bourn

The Amit conjecture about word maps on finite nilpotent groups has been shown to hold for certain classes of groups. The generalised Amit conjecture says that the probability of an element occurring in the image of a word map on a finite…

Group Theory · Mathematics 2023-05-09 Rachel D. Camina , William Cocke , Anitha Thillaisundaram

It is conjectured that for a perfect number $m,$ $\rm{rad}(m)\ll m^{\frac{1}{2}}.$ We prove bounds on the radical of multiperfect number $m$ depending on its abundancy index. Assuming the ABC conjecture, we apply this result to study gaps…

Number Theory · Mathematics 2019-01-01 Nithin Kavi , Xinyi Zhang , Viraj Jayam , Ajit Kadaveru

Consider a monad on an idempotent complete triangulated category with the property that its Eilenberg-Moore category of modules inherits a triangulation. We show that any other triangulated adjunction realizing this monad is 'essentially…

Category Theory · Mathematics 2018-08-02 Ivo Dell'Ambrogio , Beren Sanders

The moment problem in probability theory asks for criteria for when there exists a unique measure with a given tuple of moments. We study a variant of this problem for random objects in a category, where a moment is given by the average…

Probability · Mathematics 2024-05-10 Will Sawin , Melanie Matchett Wood

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin
‹ Prev 1 8 9 10 Next ›