Related papers: Counting Condorcet Domains
A preference domain is called a non-dictatorial domain if it allows the design of unanimous social choice functions (henceforth, rules) that are non-dictatorial and strategy-proof. We study a class of preference domains called…
We give a combinatorial description of the embedded contact complex (ECC) of a certain family of contact toric lens spaces that we call concave lens spaces. We also define a notion of a concave toric domain that generalizes the usual…
In this paper we consider a Condorcet domain (CD) formed by a rhombus tiling as a voting design and consider a problem of aggregation of voting designs using majority rule. A Condorcet super-domain is a collection of CDs obtained from…
In recent work (Forum Math.~Sigma, 2024), we established a correspondence between MAT-labeled graphs arising from hyperplane arrangements and regular vines from probability theory. In this paper, we extend this connection to Arrow's…
By definition, a toric domain has a boundary contact manifold diffeomorphic to a three dimensional sphere. In the present work we extend the definition of the toric domains in dimension four so that it admits a contact manifold…
In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea is to include semantic structures into abstract…
We give a number of examples of isospectral pairs of plane domains, and a particularly simple method of proving isospectrality. One of our examples is a pair of domains that are not only isospectral but homophonic: Each domain has a…
We study the size of certain acyclic domains that arise from geometric and combinatorial constructions. These acyclic domains consist of all permutations visited by commuting equivalence classes of maximal reduced decompositions if we…
We introduce new parametrized classes of shape admissible domains in R^n , n $\ge$ 2, and prove that they are compact with respect to the convergence in the sense of characteristic functions, the Hausdorff sense, the sense of compacts and…
We show that any bounded, simply connected domain with analytic boundary can be realised as a wandering domain of an entire function of any prescribed order in $(0, 1)$. Extending results of Boc Thaler, our construction simultaneously…
For convex domains with $C^{1,\epsilon}$ boundary we give a precise description of the automorphism group: if an orbit of the automorphism group accumulates on at least two different closed complex faces of the boundary, then the…
According to Courant's theorem, an eigenfunction as\-sociated with the $n$-th eigenvalue $\lambda\_n$ has at most $n$ nodal domains. A footnote in the book of Courant and Hilbert, states that the same assertion is true for any linear…
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…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
While the dynamics of transcendental entire functions in periodic Fatou components and in multiply connected wandering domains are well understood, the dynamics in simply connected wandering domains have so far eluded classification. We…
A strong version of a conjecture of Viterbo asserts that all normalized symplectic capacities agree on convex domains. We review known results showing that certain specific normalized symplectic capacities agree on convex domains. We also…
We show that if $\Omega \subset \mathbb{R}^{n+1}$, $n\geq 1$, is a uniform domain (aka 1-sided NTA domain), i.e., a domain which enjoys interior Corkscrew and Harnack Chain conditions, then uniform rectifiability of the boundary of $\Omega$…
A social decision rule (SDR) is any non-empty set-valued map that associates any profile of individual preferences with the set of (winning) alternatives. An SDR is Condorcet-consistent if it selects the set of Condorcet winners whenever…
To the best of our knowledge, a complete characterization of the domains that escape the famous Arrow's impossibility theorem remains an open question. We believe that different ways of proving Arrovian theorems illuminate this problem.…
We prove that every domain that fails to be algebraic admits the unit interval $[0, 1]$ as its Scott-continuous retract. As a result, every countable domain is algebraic.