English
Related papers

Related papers: A tight quantitative version of Arrow's impossibil…

200 papers

We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\'{e}di-Gowers theorem: For any $K\geq 1$ and $\varepsilon > 0$, there exists $\delta = \delta(K,\varepsilon)>0$ such that the following…

Combinatorics · Mathematics 2019-09-09 Xuancheng Shao

We investigate hypothesis testing in nonparametric additive models estimated using simplified smooth backfitting (Huang and Yu, Journal of Computational and Graphical Statistics, \textbf{28(2)}, 386--400, 2019). Simplified smooth…

Statistics Theory · Mathematics 2022-09-16 Suneel Babu Chatla

We present an abstract social aggregation theorem. Society, and each individual, has a preorder that may be interpreted as expressing values or beliefs. The preorders are allowed to violate both completeness and continuity, and the…

Theoretical Economics · Economics 2019-11-05 David McCarthy , Kalle Mikkola , Teruji Thomas

Let $G$ be a non-amenable countable group. We show that every almost automorphic $G$-action on a compact Hausdorff space, with a maximal equicontinuous factor whose phase space is a Cantor set, admits invariant probability measures (this…

Dynamical Systems · Mathematics 2023-12-27 María Isabel Cortez , Jaime Gómez

This note is an attempt to unconditionally prove the existence of weak one way functions (OWF). Starting from a provably intractable decision problem $L_D$ (whose existence is nonconstructively assured from the well-known discrete…

Computational Complexity · Computer Science 2023-07-19 Stefan Rass

We establish the Subgradient Theorem for monotone correspondences -- a monotone correspondence is equal to the subdifferential of a potential if and only if it is conservative, i.e. its integral along a closed path vanishes irrespective of…

Theoretical Economics · Economics 2023-08-10 Nicholas C. Bedard , Jacob K. Goeree

We prove a quantitative version of the Gibbard-Satterthwaite theorem. We show that a uniformly chosen voter profile for a neutral social choice function f of $q \ge 4$ alternatives and n voters will be manipulable with probability at least…

Combinatorics · Mathematics 2010-04-14 Marcus Isaksson , Guy Kindler , Elchanan Mossel

We prove limit theorems for row sums of a rowwise independent infinitesimal array of random variables with values in a locally compact Abelian group. First we give a proof of Gaiser's theorem, since it does not have an easy access and it is…

Probability · Mathematics 2014-03-25 Matyas Barczy , Alexander Bendikov , Gyula Pap

Let $A$ be the polynomial ring over $k$ (a field of characteristic zero) in $n+1$ variables. The commuting derivations conjecture states that $n$ commuting locally nilpotent derivations on $A$, linearly independent over $A$, must satisfy…

Algebraic Geometry · Mathematics 2008-06-13 Harm Derksen , Arno van den Essen , Stefan Maubach

We consider the problem of aggregating votes cast by a society on a fixed set of issues, where each member of the society may vote for one of several positions on each issue, but the combination of votes on the various issues is restricted…

Combinatorics · Mathematics 2016-09-07 Lefteris Kirousis , Phokion G. Kolaitis , John Livieratos

In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…

Number Theory · Mathematics 2016-02-02 Abel Castillo , Rainer Dietmann

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…

Logic · Mathematics 2021-04-06 Jan Reimann , Theodore A. Slaman

We continue our investigation of the Gauss variational problem for infinite dimensional vector measures associated with a condenser $(A_i)_{i\in I}$. It has been shown in Potential Anal., DOI:10.1007/s11118-012-9279-8 that, if some of the…

Classical Analysis and ODEs · Mathematics 2012-07-04 Natalia Zorii

Previous studies have shown that Instant-Runoff Voting (IRV) is highly resistant to coalitional manipulation (CM), though the theoretical reasons for this remain unclear. To address this gap, we analyze the susceptibility to CM of three…

Computer Science and Game Theory · Computer Science 2025-10-17 François Durand

In this short paper, we use the Rudin-Frolik order to shed light on the differing structures of invisible dictatorships given by Arrow-type social welfare functions over a countably infinite number of voters.

Logic · Mathematics 2016-08-01 Priyanka Menon

Consider the inductive limit of the general linear groups ${\rm GL}_0(2\infty,{\mathbb R})$ $= \varinjlim_{n}{\rm GL}(2n-1,{\mathbb R})$, acting on the space $X_m$ of $m$ rows, infinite in both directions, with Gaussian measure. This…

Representation Theory · Mathematics 2023-08-25 Alexandre Kosyak , Pieter Moree

Recently, Ivan Mihajlin and Alexander Smal proved a composition theorem of a universal relation and some function via so called xor composition, that is there exists some function $f:\{0,1\}^n \rightarrow \{0,1\}$ such that…

Computational Complexity · Computer Science 2023-11-14 Hao Wu

Let $p$ be a fixed prime number, and $N$ be a large integer. The 'Inverse Conjecture for the Gowers norm' states that if the "$d$-th Gowers norm" of a function $f:\F_p^N \to \F_p$ is non-negligible, that is larger than a constant…

Combinatorics · Mathematics 2008-10-20 Shachar Lovett , Roy Meshulam , Alex Samorodnitsky

To prove that a measure, linearly representable by means of a finite set of nonnegative matrices $\mathcal M$, has the weak-Gibbs property, one check the uniform convergence (on $\mathcal M^\mathbb N$) of the sequence of vectors…

Functional Analysis · Mathematics 2024-07-02 Alain Thomas

The Gibbard-Satterthwaite theorem is a cornerstone of social choice theory, stating that an onto social choice function cannot be both strategy-proof and non-dictatorial if the number of alternatives is at least three. The Duggan-Schwartz…

Computer Science and Game Theory · Computer Science 2019-05-20 Egor Ianovski , Mark C. Wilson