English
Related papers

Related papers: Compact majority-minority districts almost never e…

200 papers

In certain parliamentary democracies, there are two major parties that move in and out of power every few elections, and a third minority party that essentially never governs. We present a simple model to account for this phenomenon, in…

Physics and Society · Physics 2009-03-09 D. Volovik , M. Mobilia , S. Redner

For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…

Number Theory · Mathematics 2020-06-04 Herish Abdullah , Andam Ali Mustafa , Francesco Pappalardi

The Council of the European Union (EU) is one of the main decision-making bodies of the EU. A number of decisions require a qualified majority, the support of 55% of the member states (currently 15) that represent at least 65% of the total…

Physics and Society · Physics 2026-04-02 Dóra Gréta Petróczy , László Csató

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an…

Information Theory · Computer Science 2010-01-26 Galen Reeves , Michael Gastpar

We estimate the asymptotic density of the set $\bar{A}$ of primes $p$ satisfying the constraint that $p+1$ and $p-1$ have only one prime divisor larger than $3$. We also estimate the density of a maximal subset $\bar{B} \subset \bar{A}$…

Number Theory · Mathematics 2018-12-31 Carlos Esparza , Lukas Gehring

Generating realistic artificial preference distributions is an important part of any simulation analysis of electoral systems. While this has been discussed in some detail in the context of a single electoral district, many electoral…

Computer Science and Game Theory · Computer Science 2017-06-30 Geoffrey Pritchard , Mark C. Wilson

A long-standing conjecture of Podewski states that every minimal field is algebraically closed. It was proved by Wagner for fields of positive characteristic, but it remains wide open in the zero-characteristic case. We reduce Podewski's…

Logic · Mathematics 2013-12-03 Krzysztof Krupiński , Predrag Tanović , Frank O. Wagner

Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…

Statistics Theory · Mathematics 2024-03-07 Mikhail Ermakov

The puzzling idea that the combination of independent estimates of the magnitude of a quantity results in a very accurate prediction, which is superior to any or, at least, to most of the individual estimates is known as the wisdom of…

Applications · Statistics 2021-05-26 Sandro M. Reia , José F. Fontanari

Let $\Lambda$ be a uniformly discrete set and $S$ be a compact set in $R$. We prove that if there exists a bounded sequence of functions in Paley--Wiener space $PW_S$, which approximates $\delta-$functions on $\Lambda$ with $l^2-$error $d$,…

Classical Analysis and ODEs · Mathematics 2013-04-03 Alexander Olevskii , Alexander Ulanovskii

Let A be finite set equipped with a probability distribution P, and let M be a "mass" function on A. A characterization is given for the most efficient way in which A^n can be covered using spheres of a fixed radius. A covering is a subset…

Probability · Mathematics 2007-05-23 Ioannis Kontoyiannis , Ali Devin Sezer

Let $(Z_k)_{k\geq 1}$ be a sequence of independent and identically distributed complex random variables with common distribution $\mu$ and let $P_n(X):=\prod_{k=1}^n (X-Z_k)$ the associated random polynomial in $\mathbb C[X]$. In [Kab15],…

Probability · Mathematics 2024-03-06 Jürgen Angst , Dominique Malicet , Guillaume Poly

We study a certain class of piecewise monotonic maps of interval. These maps are strictly monotone on finite interval partition, satisfies Markov condition and have generator property. We show that for a function from this class…

Dynamical Systems · Mathematics 2020-12-18 Vojtěch Pravec , Jan Tesarčík

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of…

Number Theory · Mathematics 2022-10-10 Abhishek Jha , Carlo Sanna

We consider the problem of estimating the missing mass, partition function or evidence and its probability distribution in the case that for each sample point in the discrete sample space its (unnormalized) probability mass is revealed.…

Statistics Theory · Mathematics 2026-03-16 Bastiaan J. Braams

We show that for all $\psi$-mixing shifts distributions of the numbers of multiple recurrencies to shrinking cylindrical neighborhoods of all points are close either to Poisson or to compound Poisson distributions. We also describe…

Probability · Mathematics 2012-12-11 Yuri Kifer , Ariel Rapaport

Construction of tight confidence regions and intervals is central to statistical inference and decision making. This paper develops new theory showing minimum average volume confidence regions for categorical data. More precisely, consider…

Machine Learning · Statistics 2021-02-01 Matthew L. Malloy , Ardhendu Tripathy , Robert D. Nowak

We study the voter model with a finite density of zealots--voters than never change opinion. For equal numbers of zealots of each species, the distribution of magnetization (opinions) is Gaussian in the mean-field limit as well as in one…

Physics and Society · Physics 2007-08-23 M. Mobilia , A. Petersen , S. Redner

The Condorcet Jury Theorem or the Miracle of Aggregation are frequently invoked to ensure the competence of some aggregate decision-making processes. In this article we explore an estimation of the prior probability of the thesis predicted…

Theoretical Economics · Economics 2022-06-22 Álvaro Romaniega

We prove the unexpected result that almost uniform sampling of independent sets in graphs is possible via a probabilistic polynomial time algorithm. Note that our sampling algorithm (if correct) has extremely surprising consequences; the…

Computational Complexity · Computer Science 2023-12-20 Andras Farago