English
Related papers

Related papers: Exact-$m$-majority terms

200 papers

We show that an idempotent lies in the center if it commutes with the other idempotents in the ring. Next, we introduce a partition of the set of idempotents and show that the automorphisms of the ring act transitively on each equivalence…

Rings and Algebras · Mathematics 2023-11-16 Vineeth Chintala

Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…

Logic · Mathematics 2026-04-28 Yifan Jia , Heer Tern Koh , Bakh Khoussainov

Sums of $M$ consecutive squared integers $\left(a+i\right)^{2}$ equaling squared integers (for $a\geq1$, $0\leq i\leq M-1$) yield certain linear groupings of pairs $\left(a_{1},a_{2}\right)$ of $a$ values for successive same values of $M$…

Number Theory · Mathematics 2014-10-06 Vladimir Pletser

We know that if there are $k$ distinct prime factors of $n \in \mathbb{N}$, then the ring $\mathbb{Z}_n$ of integers modulo $n$ has exactly $2^k$ idempotent elements. In this article, we try to describe all the idempotents of $\mathbb{Z}_n$…

Number Theory · Mathematics 2024-10-21 Suman Mondal , Dhiren Kumar Basnet

A group is said to be strongly amenable if each of its proximal topological actions has a fixed point. We show that a finitely generated group is strongly amenable if and only if it is virtually nilpotent. More generally, a countable…

Group Theory · Mathematics 2020-01-08 Joshua Frisch , Omer Tamuz , Pooya Vahidi Ferdowsi

This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.

General Literature · Computer Science 2007-05-23 Ming-Yang Kao

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

Based on the notions of conciseness and semiconciseness, we show that these properties are not equivalent by proving that a word originally presented by Ol'shanskii is semiconcise but not concise. We further establish that every…

Group Theory · Mathematics 2025-09-19 Andoni Zozaya

We define a word in two positive definite (complex Hermitian) matrices $A$ and $B$ as a finite product of real powers of $A$ and $B$. The question of which words have only positive eigenvalues is addressed. This question was raised some…

Operator Algebras · Mathematics 2007-05-23 Christopher Hillar , Charles R. Johnson

Paper develops axiomatic characterization of the family of majority vote rules in the way alternative to characterization of the majority vote given in paper of Kenneth O. May in the 1952. This, similar but different, axiomatics focuses on…

Computer Science and Game Theory · Computer Science 2018-07-03 Artur Poplawski

We clarify the relationship between the linear commutator and the ordinary commutator by showing that in any variety satisfying a nontrivial idempotent Mal'cev condition the linear commutator is definable in terms of the centralizer…

Rings and Algebras · Mathematics 2008-02-03 Keith A. Kearnes , Ågnes Szendrei

A module over a ring $R$ is pure projective provided it is isomorphic to a direct summand of a direct sum of finitely presented modules. We develop tools for the classification of pure projective modules over commutative noetherian rings.…

Commutative Algebra · Mathematics 2023-11-10 Dolors Herbera , Pavel Příhoda , Roger Wiegand

A finite set of integers $A$ is a sum-dominant (also called an More Sums Than Differences or MSTD) set if $|A+A| > |A-A|$. While almost all subsets of $\{0, \dots, n\}$ are not sum-dominant, interestingly a small positive percentage are. We…

Number Theory · Mathematics 2018-08-23 Hung Chu , Nathan McNew , Steven J. Miller , Victor Xu , Sean Zhang

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…

Number Theory · Mathematics 2012-10-11 James Lanterman

Let $a,b$ be elements in a unital C$^*$-algebra with $0\leq a,b\leq 1$. The element $a$ is absolutely compatible with $b$ if $$\vert a - b \vert + \vert 1 - a - b \vert = 1.$$ In this note we find some technical characterizations of…

Operator Algebras · Mathematics 2018-10-26 Nabin K. Jana , Anil K. Karn , Antonio M. Peralta

The set of all m-tuples of compatible full conditional distributions on discrete random variables is an algebraic set whose defining ideal is a unimodular toric ideal. We identify the defining polynomials of these ideals with closed walks…

Algebraic Geometry · Mathematics 2007-06-13 Aleksandra B Slavkovic , Seth Sullivant

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

We study asymmetric regular types. If $\frak p$ is regular and $A$-asymmetric then there exists a strict order such that Morley sequences in $\frak p$ over $A$ are strictly increasing (we allow Morley sequences to be indexed by elements of…

Logic · Mathematics 2015-03-17 Slavko Moconja , Predrag Tanović

Together with a characteristic function, idempotent permutations uniquely determine idempotent maps, as well as their linearly ordered arrangement simultaneously. Furthermore, in-place linear time transformations are possible between them.…

Data Structures and Algorithms · Computer Science 2013-07-16 A. Emre Cetin

Monotonicity and recursivity are central assumptions in intertemporal consumption problems under ambiguity. We show that monotone recursive preferences admit both a recursive and an ex-ante representation, and that the certainty equivalent…

Theoretical Economics · Economics 2026-01-23 Massimo Marinacci , Giulio Principi , Lorenzo Stanca