English
Related papers

Related papers: Exact-$m$-majority terms

200 papers

We consider the problem where a set of individuals has to classify $m$ objects into $p$ categories by aggregating the individual classifications, and no category can be left empty. An aggregator satisfies \emph{Expertise} if individuals are…

Theoretical Economics · Economics 2025-02-07 Federico Fioravanti

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 describe a complete list of absolutely…

Operator Algebras · Mathematics 2018-10-31 Nabin K. Jana , Anil K. Karn

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…

Numerical Analysis · Mathematics 2008-05-21 James Demmel , Ioana Dumitriu , Olga Holtz , Plamen Koev

Building on previous work, we study the splitting of idempotents in the category of extensions $\mathbb{E}\operatorname{-Ext}(\mathcal{C})$ associated to a pair $(\mathcal{C},\mathbb{E})$ of an additive category and a biadditive functor to…

Category Theory · Mathematics 2023-10-27 Raphael Bennett-Tennenhaus , Johanne Haugland , Mads Hustad Sandøy , Amit Shah

A new method of analysing positive bistochastic maps on the algebra of complex matrices $M_{3}$ has been proposed. By identifying the set of such maps with a convex set of linear operators on $\mathbb{R}^{8}$, one can employ techniques from…

Mathematical Physics · Physics 2016-03-30 Marek Miller , Robert Olkiewicz

Suppose that G is a locally compact abelian group, and write M(G) for the algebra of bounded, regular, complex-valued measures under convolution. A measure \mu in M(G) is said to be idempotent if \mu * \mu = \mu, or alternatively if the…

Classical Analysis and ODEs · Mathematics 2010-04-02 Ben Green , Tom Sanders

Word embedding, specially with its recent developments, promises a quantification of the similarity between terms. However, it is not clear to which extent this similarity value can be genuinely meaningful and useful for subsequent tasks.…

Computation and Language · Computer Science 2018-04-05 Navid Rekabsaz , Mihai Lupu , Allan Hanbury

Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than $0$. It is shown that unitary…

Information Theory · Computer Science 2017-02-07 Ted Hurley

For a sequence $M=(m_{i})_{i=0}^{\infty}$ of integers such that $m_{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for…

Number Theory · Mathematics 2024-03-08 Błażej Żmija

We develop the theory of the higher commutator for Taylor varieties. A new higher commutator operation called the hypercommutator is defined using a type of invariant relation called a higher dimensional congruence. The hypercommutator is…

Rings and Algebras · Mathematics 2020-08-04 Andrew Moorhead

We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…

Group Theory · Mathematics 2026-05-01 Narutaka Ozawa

A new hierarchy of "exact" unification types is introduced, motivated by the study of admissibility for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by…

Logic · Mathematics 2014-10-22 Leonardo Cabrer , George Metcalfe

Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures. Convergence is the property of Infinitary Term…

Logic in Computer Science · Computer Science 2015-07-01 Stefan Michael Kahrs

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

Number Theory · Mathematics 2021-08-03 Jorma Jormakka , Sourangshu Ghosh

A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…

Combinatorics · Mathematics 2025-09-01 Dustin R. Baker , Bryan A. Curtis , Joe Miller , Hope Pungello

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2015-06-30 Tewodros Amdeberhan , Roberto Tauraso

Let N be a positive integer and let f be a newform of weight 2 on \Gamma_0(N). In earlier joint work with K. Ribet and W. Stein, we introduced the notions of the modular number and the congruence number of the quotient abelian variety A_f…

Number Theory · Mathematics 2025-10-07 Amod Agashe

Congruence families, i.e., $\ell$-adic convergence for well-defined arithmetic subsequences, is a commonplace phenomenon for the coefficients of modular forms. Such families superficially resemble one another, but they often vary…

Number Theory · Mathematics 2024-03-19 Nicolas Allen Smoot

We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and…

Combinatorics · Mathematics 2025-06-06 Eva Foster , Aleksi Saarela , Aleksi Vanhatalo

Confluence of a nondeterministic program ensures a functional input-output relation, freeing the programmer from considering the actual scheduling strategy, and allowing optimized and perhaps parallel implementations. The more general…

Programming Languages · Computer Science 2018-09-14 Henning Christiansen , Maja Kirkeby
‹ Prev 1 3 4 5 6 7 10 Next ›