English
Related papers

Related papers: The Largest Condorcet Domains on 8 Alternatives

200 papers

We realize the exceptional superconformal algebra $CK_6$, spanned by 32 fields, inside the Lie superalgebra of pseudodifferential symbols on the supercircle $S^{1|3}$. We obtain a one-parameter family of irreducible representations of…

High Energy Physics - Theory · Physics 2007-05-23 Elena Poletaeva

In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations. Here we describe algorithms making the classification possible.

Number Theory · Mathematics 2019-11-07 Mathieu Dutour Sikiric , Achill Schuermann , Frank Vallentin

We review and compare five ways of assigning totally ordered sizes to subsets of the natural numbers: cardinality, infinite lottery logic with mirror cardinalities, natural density, generalised density, and $\alpha$-numerosity. Generalised…

Logic · Mathematics 2024-08-08 Sylvia Wenmackers

We provide a simple injective proof that the number of 132-avoiding permutations with a unique longest increasing subsequence is at least as large as the number of 132-avoiding permutations without a unique longest increasing subsequence.

Combinatorics · Mathematics 2023-03-07 Nicholas Van Nimwegen

We construct a convex set $A$ with cardinality $2n$ and with the property that an element of the difference set $A-A$ can be represented in $n$ different ways. We also show that this construction is optimal by proving that for any convex…

Combinatorics · Mathematics 2022-08-19 Oliver Roche-Newton , Audie Warren

Winner selection by majority, in an election between two candidates, is the only rule compatible with democratic principles. Instead, when the candidates are three or more and the voters rank candidates in order of preference, there are no…

Physics and Society · Physics 2016-04-19 Pierluigi Contucci , Emanuele Panizzi , Federico Ricci-Tersenghi , Alina Sîrbu

In [J. Cantarella, D. DeTurck, H. Gluck and M. Teytel, J. Math. Phys. 41:5615 (2000)] the helicity isoperimetric problem which asks to find a smooth domain of fixed volume which maximises Biot-Savart helicity among all other smooth domains…

Analysis of PDEs · Mathematics 2025-10-24 Wadim Gerner

In a recent article, Galam and Mauger proposed an invariant for site and bond percolation thresholds, based on known values for twenty lattices (Eur. Phys. J. B 1 (1998) 255-258). Here we give a larger list of values for more than forty…

Statistical Mechanics · Physics 2015-06-25 Steven C. van der Marck

Two permutations of the natural numbers diverge if the absolute value of the difference of their elements in the same position goes to infinity. We show that there exists an infinite number of pairwise divergent permutations of the…

Combinatorics · Mathematics 2019-04-11 Emanuela Fachini , János Körner

We present a collection of $7582$ real-world elections divided into $25$ datasets from various sources ranging from sports competitions over music charts to survey- and indicator-based rankings. We provide evidence that the collected…

Computer Science and Game Theory · Computer Science 2023-01-09 Niclas Boehmer , Nathan Schaar

We consider a family, $\mathcal{F}$, of subsets of an $n$-set such that the cardinality of the symmetric difference of any two elements $F,F'\in\mathcal{F}$ is not a multiple of 4. We prove that the maximal size of $\mathcal{F}$ is bounded…

Combinatorics · Mathematics 2014-03-28 Sophie Morier-Genoud , Valentin Ovsienko

We solve two related extremal problems in the theory of permutations. A set $Q$ of permutations of the integers 1 to $n$ is inversion-complete (resp., pair-complete) if for every inversion $(j,i)$, where $1 \le i \textless{} j \le n$,…

Combinatorics · Mathematics 2015-03-03 Eric Balandraud , Maurice Queyranne , Fabio Tardella

Conflict-avoiding codes (CACs) have been used in multiple-access collision channel without feedback. The size of a CAC is the number of potential users that can be supported in the system. A code with maximum size is called optimal. The use…

Information Theory · Computer Science 2021-02-25 Chun-e Zhao , Wenping Ma , Tongjiang Yan , Yuhua Sun

Fishburn's alternating scheme domains occupy a special place in the theory of Condorcet domains. Karpov (2023) generalised these domains and made an interesting observation proving that all of them are single-picked on a circle. However, an…

Combinatorics · Mathematics 2023-10-25 Arkadii Slinko

The Candidate Cluster and Protocluster Catalog (CCPC) is a list of objects at redshifts z > 2 composed of galaxies with spectroscopically confirmed redshifts that are coincident on the sky and in redshift. These protoclusters are identified…

Astrophysics of Galaxies · Physics 2016-12-14 J. R. Franck , S. S. McGaugh

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

Algebraic Geometry · Mathematics 2025-06-09 Yifan Zhang , Joe Kileel

We prove that there exists a bounded convex domain $\Omega \subset \mathbf{R}^3$ of fixed volume that minimizes the first positive curl eigenvalue among all other bounded convex domains of the same volume. We show that this optimal domain…

Analysis of PDEs · Mathematics 2026-02-13 Alberto Enciso , Wadim Gerner , Daniel Peralta-Salas

The fundamental and natural connection between the infinite constellation (IC) dimension and the best diversity order it can achieve is investigated in this paper. In the first part of this work we develop an upper bound on the diversity…

Information Theory · Computer Science 2015-03-19 Yair Yona , Meir Feder

The new voting system of the Council of the European Union cannot be represented as the intersection of six or fewer weighted games, i.e., its dimension is at least 7. This sets a new record for real-world voting bodies. A heuristic…

Optimization and Control · Mathematics 2019-11-26 Sascha Kurz , Stefan Napel

We give a construction of a convex set $A \subset \mathbb R$ with cardinality $n$ such that $A-A$ contains a convex subset with cardinality $\Omega (n^2)$. We also consider the following variant of this problem: given a convex set $A$, what…

Combinatorics · Mathematics 2023-09-15 Krishnendu Bhowmick , Ben Lund , Oliver Roche-Newton