Related papers: Aggregation of evaluations without unanimity
Motzkin and Taussky (and independently, Gerstenhaber) proved that the unital algebra generated by a pair of commuting $d\times d$ matrices over a field has dimension at most $d$. Since then, it has remained an open problem to determine…
A natural notion of rationality/consistency for aggregating models is that, for all (possibly aggregated) models $A$ and $B$, if the output of model $A$ is $f(A)$ and if the output model $B$ is $f(B)$, then the output of the model obtained…
We construct two associative algebras from a vertex operator algebra $V$ and a general automorphism $g$ of $V$. The first, called $g$-twisted zero-mode algebra, is a subquotient of what we call $g$-twisted universal enveloping algebra of…
We prove the following conjecture of Shkredov and Solymosi: every subset $A \subset \mathbf{Z}^2$ such that $\sum_{a\in A\setminus\{0\}} 1/\left\|a\right\|^{2} = +\infty$ contains the three vertices of an isosceles right triangle. To do…
Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…
We generalize the Arzel\`a-Ascoli theorem to the setting of matrix order unit spaces, extending the work of Antonescu-Christensen on unital C*-algebras. This gives an affirmative answer to a question of Antonescu and Christensen.
Menger's basis property is a generalization of $\sigma$-compactness and admits an elegant combinatorial interpretation. We introduce a general combinatorial method to construct non $\sigma$-compact sets of reals with Menger's property.…
Given a representation of a unimodular locally compact group, we discuss criteria for associated coherent state expansions in terms of the commuting algebra. It turns out that for those representations that admit such expansions there…
Associated to any uniform finite layered graph Gamma there is a noncommutative graded quadratic algebra A(Gamma) given by a construction due to Gelfand, Retakh, Serconek and Wilson. It is natural to ask when these algebras are Koszul.…
We address generating theorems from a given set of axioms, without proof goal, aiming at value from a mathematical point of view or as lemmas for automated proving. As benchmark, we convert a fragment of the Metamath database set.mm. Our…
In "Homotopy decomposition of classifying spaces via elementary Abelian subgroups", Stephan Jackowski and James McClure show, for functors admitting a Mackey complement over categories holding a direct product, a general result on vanishing…
In this thesis, we study the existence of universal objets of two differents types in the theory of topological groups and theirs actions on compacts spaces. In the first part, we contribute to the problem of existence of test spaces for…
We give a combinatorial extension of the classical inequalities of Maclaurin about symmetric functions of several variables. We discuss two problems - one analytical and another combinatorial - and show that they are in some sense…
We prove that indecomposable transjective modules over cluster-tilted algebras are uniquely determined by their dimension vectors. Similarly, we prove that for cluster-concealed algebras, rigid modules lifting to rigid objects in the…
In this paper we study the aggregation problem that can be formulated as follows. Assume that we have a family of estimators $\mathcal{F}$ built on the basis of available observations. The goal is to construct a new estimator whose risk is…
Aggregating signals from a collection of noisy sources is a fundamental problem in many domains including crowd-sourcing, multi-agent planning, sensor networks, signal processing, voting, ensemble learning, and federated learning. The core…
This paper addresses the semantics of weighted argumentation graphs that are bipolar, i.e. contain both attacks and supports for arguments. It builds on previous work by Amgoud, Ben-Naim et. al. We study the various characteristics of…
Given a finite collection of estimators or classifiers, we study the problem of model selection type aggregation, that is, we construct a new estimator or classifier, called aggregate, which is nearly as good as the best among them with…
Arrow's theorem implies that a social choice function satisfying Transitivity, the Pareto Principle (Unanimity) and Independence of Irrelevant Alternatives (IIA) must be dictatorial. When non-strict preferences are allowed, a dictatorial…
In this paper, we study length categories using iterated extensions. We consider the problem of classifying all indecomposable objects in a length category, and the problem of characterizing those length categories that are uniserial. We…