English
Related papers

Related papers: Exact-$m$-majority terms

200 papers

A discrete group $\Gamma$ is called exact if the reduced group C*-algebra ${C_{\lambda}}^{*}(\Gamma)$ is exact as C*-algebras, and a discrete group $\Lambda$ is called residually exact if every nonunital element $g \in \Lambda$ admits a…

Group Theory · Mathematics 2025-12-16 Hikaru Awazu

Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…

Formal Languages and Automata Theory · Computer Science 2015-03-19 A. Rubtsov , M. Vyalyi

We define the notion of exact completion with respect to an existential elementary doctrine. We observe that the forgetful functor from the 2-category exact categories to existential elementary doctrines has a left biadjoint that can be…

Category Theory · Mathematics 2012-12-06 Maria Emilia Maietti , Giuseppe Rosolini

Let $R$ be a finite commutative local principal ring, and let $H(R)$ denote the corresponding quaternion ring. We show that an element of $H(R)$ is a product of idempotents if and only if it can be expressed as a product of two idempotents.…

Rings and Algebras · Mathematics 2026-02-12 David Dolžan

The algebraic variety defined by the idempotents of an incidence monoid is investigated. Its irreducible components are determined. The intersection with an antichain submonoid is shown to be the union of these irreducible components. The…

Combinatorics · Mathematics 2022-08-03 Mahir Bilen Can , Ana Casimiro , Antonio Malheiro

When we investigate a type system, it is helpful if we can establish the well-foundedness of types or terms with respect to a certain hierarchy, and the Extended Calculus of Constructions (called $ECC$, defined and studied comprehensively…

Logic in Computer Science · Computer Science 2021-05-12 Eitetsu Ken , Masaki Natori , Kenji Tojo , Kazuki Watanabe

Idempotents yield much insight in the structure of finite semigroups and semirings. In this article, we obtain some results on (multiplicatively) idempotents of the endomorphism semiring of a finite chain. We prove that the set of all…

Rings and Algebras · Mathematics 2012-10-30 Ivan Trendafilov , Dimitrinka Vladeva

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Number Theory · Mathematics 2012-11-06 Maria Bras-Amorós , Pedro A. García-Sánchez , Albert Vico-Oton

We can define a module to be an exact functor on a small abelian category. This is explained and shown to be equivalent to the usual definition but it does offer a different perspective, inspired by the notions from model theory of…

Representation Theory · Mathematics 2018-01-25 Mike Prest

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

Group Theory · Mathematics 2024-12-05 Jonathan Warne

A majority digraph is a finite simple digraph $G=(V,\to)$ such that there exist finite sets $A_v$ for the vertices $v\in V$ with the following property: $u\to v$ if and only if "more than half of the $A_u$ are $A_v$". That is, $u\to v$ if…

Combinatorics · Mathematics 2015-09-28 Tri Lai , Jörg Endrullis , Lawrence S. Moss

Let M be a filtered module. Some properties of elements of M are "generic" in the following sense: (being open/stable) if an element z of M has a property P then any approximation of z has P; (being dense) any element of M is approximated…

Commutative Algebra · Mathematics 2019-10-15 Dmitry Kerner

A ring $R$ is (strongly) 2-nil-clean if every element in $R$ is the sum of two idempotents and a nilpotent (that commute). Fundamental properties of such rings are discussed. Let $R$ be a 2-primal ring. If $R$ is strongly 2-nil-clean, we…

Rings and Algebras · Mathematics 2016-11-03 H. Chen , M. Sheibani

Watts's Theorem says that a right exact functor F:Mod R-->Mod S that commutes with direct sums is isomorphic to -\otimes_R B where B is the R-S-bimodule FR. The main result in this paper is the following: if A is a cocomplete abelian…

Rings and Algebras · Mathematics 2008-06-05 A. Nyman , S. Paul Smith

Let p1, p2,..., pn be distinct prime numbers, and let Nn be their product. We prove that, for any positive integer L that is divisible by the least common multiple of p1 minus one, p2 minus one, and so on, and for integers a1, a2,..., an…

Number Theory · Mathematics 2025-10-14 Shao-Yuan Huang , Hsiu-Yu Wu

Suppose $(\mathcal{C},\mathbb{E},\mathfrak{s})$ is an $n$-exangulated category. We show that the idempotent completion and the weak idempotent completion of $\mathcal{C}$ are again $n$-exangulated categories. Furthermore, we also show that…

Category Theory · Mathematics 2024-08-23 Carlo Klapproth , Dixy Msapato , Amit Shah

The leading term in the normal approximation to the distribution of Student's t statistic is derived in a general setting, with the sole assumption being that the sampled distribution is in the domain of attraction of a normal law. The form…

Probability · Mathematics 2007-05-23 Peter Hall , Qiying Wang

It is known that if A and B are two n-by-n complex matrices and (A,A^T) is simultaneously equivalent to (B,B^T), then A is congruent to B. We extend this statement to multilinear forms.

Representation Theory · Mathematics 2007-10-04 Genrich R. Belitskii , Vladimir V. Sergeichuk

We prove the open question posed by Zhuang and Hu in Remark 3.1. More generally, we consider symmetric joint probability mass functions and joint densities whose associated quadratic form is non-negative. In this class, for every \(r>0\),…

Probability · Mathematics 2026-05-27 Zhekai Pang

We study popularity for matchings under preferences. This solution concept captures matchings that do not lose against any other matching in a majority vote by the agents. A popular matching is said to be robust if it is popular among…

Data Structures and Algorithms · Computer Science 2025-10-23 Martin Bullinger , Gergely Csáji , Rohith Reddy Gangam , Parnian Shahkar
‹ Prev 1 4 5 6 7 8 10 Next ›