Related papers: Counting Condorcet Domains
We study the second order elliptic equations of non-divergence form in a planar domain with complicated geometry. In this case the domain winds around a fixed circle infinitely many times and converges to it when the rotating angle goes to…
We give a complete description of bounded Reinhardt domains of finite boundary smoothness that have non-compact automorphism group. As part of this program, we show that the classification of domains with non-compact automorphism group and…
In this note, we provide a complete classification for entire area maximizing hypersurfaces having an isolated singularity. We also construct an interesting illustrated example. For area maximizing hypersurfaces over exterior domains, we…
For any sequence of properly convex domains in the real projective plane such that the zeros of Pick differentials have bounded multiplicity and get further and further apart, we determined all Hausdorff limit domains that one can obtain…
This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…
A cut in a digraph $D=(V,A)$ is a set of arcs $\{uv \in A: u\in U, v\notin U\}$, for some $U\subseteq V$. It is known that the arc set $A$ is covered by $k$ cuts if and only if it admits a $k$-coloring such that no two consecutive arcs $uv,…
The weakly relational domain of Octagons offers a decent compromise between precision and efficiency for numerical properties. Here, we are concerned with the construction of non-numerical relational domains. We provide a general…
We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…
Covtree - a partial order on certain sets of finite, unlabeled causal sets - is a manifestly covariant framework for causal set dynamics. Here, as a first step in picking out a class of physically well-motivated covtree dynamics, we study…
Population domain means are frequently expected to respect shape or order constraints that arise naturally with survey data. For example, given a job category, mean salaries in big cities might be expected to be higher than those in small…
A natural and established way to restrict the constraint satisfaction problem is to fix the relations that can be used to pose constraints; such a family of relations is called a constraint language. In this article, we study arc…
Given a positive rational $q$, we consider Dyck paths having height at most two with some constraints on the number of consecutive peaks and consecutive valleys, depending on $q$. We introduce a general class of Dyck paths, called rational…
This paper is an extension of the author's lecture "Unique Determination of Polyhedral Domains and $p$-Moduli of Path Families" given at the International Conference "Metric Geometry of Surfaces and Polyhedra" dedicated to the 100th…
Many hard computational social choice problems are known to become tractable when voters' preferences belong to a restricted domain, such as those of single-peaked or single-crossing preferences. However, to date, all algorithmic results of…
We prove the existence of nontrivial unbounded exceptional domains in the Euclidean space $\R^N$, $N\geq4$. These domains arise as perturbations of complements of straight cylinders in $\R^N$, and by definition they support a positive…
The assumption of complete domain knowledge is not warranted for robot planning and decision-making in the real world. It could be due to design flaws or arise from domain ramifications or qualifications. In such cases, existing planning…
We investigate unbounded domains in hierarchically hyperbolic groups and obtain constraints on the possible hierarchical structures. Using these insights, we characterise the structures of virtually abelian HHGs and show that the class of…
We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely…
We prove that if $\Omega$ is a simply connected quadrature domain for a distribution with compact support and the infinity point belongs the boundary, then the boundary has an asymptotic curve that is either a straight line or a parabola or…