Related papers: Counting Condorcet Domains

For any pseudoconvex Runge domain $\Omega\subset\mathbb{C}^2$ we prove that every closed discrete subset in $\Omega$ is contained in a properly embedded complex curve in $\Omega$ with any prescribed topology (possibly infinite).

Throughout, $T$ denotes a complete first-order theory in a countable language $L$ that has infinite models and $I(\aleph_0,T)$ denotes the number of countable models of $T$, up to an isomorphism. To determine $I(\aleph_0,T)$, it suffices to…

Define a "Liouville domain" to be a compact exact symplectic manifold with contact-type boundary. We use embedded contact homology to assign to each four-dimensional Liouville domain (or subset thereof) a sequence of real numbers, which we…

Inspired by the classical Besov $p$-space ($1<p<\infty$) defined by means of higher-order derivatives on the upper half-plane, we introduce Besov-type spaces on simply connected domains. We study the relation between the geometric…

We prove that Loday's polytopal realisation of the nth Tamari lattice T_n, called associahedron, has 2^{n-1} common points with the permutohedron, which form a maximal never-middle (symmetric) Condorcet domain.

Sequence representations supporting queries $access$, $select$ and $rank$ are at the core of many data structures. There is a considerable gap between the various upper bounds and the few lower bounds known for such representations, and how…

We investigate the power of censoring techniques, first developed for learning {\em fair representations}, to address domain generalization. We examine {\em adversarial} censoring techniques for learning invariant representations from…

In this article, we study the monoid of fractional ideals and the ideal class semigroup of an arbitrary given one dimensional normal domain O obtained by an infinite integral extension of a Dedekind domain. We introduce a notion of "upper…

Normann proved that the domains of the game model of PCF (the domains of sequential functionals) need not be dcpos. Sazonov has defined natural domains for a theory of such incomplete domains. This paper further develops that theory. It…

We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…

In this paper, we study the domains in $\mathbb{C}^n$ that are invariant under the positive flows of some globally defined, complete holomorphic vector field with a globally attracting fixed point at the origin. Our first result says that…

We uncover a new relation between Closeness centrality and the Condorcet principle. We define a Condorcet winner in a graph as a node that compared to any other node is closer to more nodes. In other words, if we assume that nodes vote on a…

We introduce BallotRank, a ranked preference aggregation method derived from a modified PageRank algorithm. It is a Condorcet-consistent method without damping, and empirical examination of nearly 2,000 ranked choice elections and over…

In this paper, we show how the notion of tree dimension can be used in the verification of constrained Horn clauses (CHCs). The dimension of a tree is a numerical measure of its branching complexity and the concept here applies to Horn…

Identifying the topic (domain) of each user's utterance in open-domain conversational systems is a crucial step for all subsequent language understanding and response tasks. In particular, for complex domains, an utterance is often routed…

Let $H^n$ be the metric space of all bounded domains in $C^n$ with the metric equal to the Hausdorff distance between boundaries of domains. We prove that the dimension of the group of automorphisms of domains is an upper semicontinuous…

We introduce a continuous domain for function spaces over topological spaces which are not core-compact. Notable examples of such topological spaces include the real line with the upper limit topology, which is used in solution of initial…

In an election where $n$ voters rank $m$ candidates, a Condorcet winning set is a committee of $k$ candidates such that for any outside candidate, a majority of voters prefer some committee member. Condorcet's paradox shows that some…

Let $C_{\theta}$ be a circular cone in Euclidean space $\mathbb{R}^{3}$,which apex is the origin and apex angle of the cone is $\theta\in \left(\pi/3, \pi\right)$. Let $M_\theta$ be the class of compact convex domains in Euclidean space…

A leaf path language is a Boolean combination of sets of the form $\mathsf{{}^mE}^k L$, with $k \ge 1$ and $L$ a regular word language, which consist of those forests where the node labels in at least $k$ leaf-to-root paths make up a word…