Related papers: Counting Condorcet Domains
We study the related notions of curvature and perimeter for toric boundaries and their implications for symplectic packing problems; a natural setting for this is a generalized version of convex toric domain which we also study, where there…
For each probability distribution on a countable alphabet, a sequence of positive functionals are developed as tail indices based on Turing's perspective. By and only by the asymptotic behavior of these indices, domains of attraction for…
Domains in infinite jets present the simplest class of diffieties with boundary. In this note some basic elements of geometry of these domains are introduced and an analogue of the C-spectral sequence in this context is studied. This, in…
We prove well-posedness and regularity results for elliptic boundary value problems on certain domains with a smooth set of singular points. Our class of domains contains the class of domains with isolated oscillating conical singularities,…
We give, in dimensions three or greater, an example of a bounded, pseudoconvex, circular domain in complex space with smooth real analytic boundary and non-compact automorphism group which is not biholomorphically equivalent to any…
A domain $R$ is said to have the finite factorization property if every nonzero non-unit element of $R$ has at least one and at most finitely many distinct factorizations up to multiplication of irreducible factors by central units. Let $k$…
We establish a characterization (under some natural conditions) of those orders in Dedekind domains which allow a transfer homomorphism to a monoid of zero-sum sequences. As a consequence, the inclusion map to the Dedekind domain is a…
We prove a general Mosco convergence theorem for bounded Euclidean domains satisfying a set of mild geometric hypotheses. For bounded domains, this notion implies norm-resolvent convergence for the Dirichlet Laplacian which in turn ensures…
We prove two types of nodal results for density one subsequences of an orthonormal basis $\{\phi_j\}$ of eigenfunctions of the Laplacian on a negatively curved compact surface. The first type of result involves the intersections $Z_{\phi_j}…
Let $X$ be an arbitrary complex surface and $D \subset X$ a domain that has a non compact group of holomorphic automorphisms. A characterization of those domains $D$ that admit a smooth real analytic, finite type boundary orbit accumulation…
In this paper, we propose a novel framework to analyze the theoretical properties of the learning process for a representative type of domain adaptation, which combines data from multiple sources and one target (or briefly called…
Motivated by the classical bounded H\"{o}lder domains, we introduce the notion of an unbounded simply connected H\"{o}lder domain. We prove analytic and geometric characterizations of those domains with the aid of the spherical metric and…
Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$-spaces instead of restricting to posets. In this paper, we respond to this calling by…
Abstract interpretation is a method to automatically find invariants of programs or pieces of code whose semantics is given via least fixed-points. Up-to techniques have been introduced as enhancements of coinduction, an abstract principle…
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…
We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…
We present a selection theorem for domains in $\mathbb{C}^n$, $n\ge 1$, which states that any tamed sequence of pointed connected open subsets admits a subsequence convergent to its own kernel in the sense of Carath\'eodory. Not only is…
Recursive domain equations have natural solutions. In particular there are domains defined by strictly positive induction. The class of countably based domains gives a computability theory for possibly non-countably based topological…
Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual…
We obtain upper bounds on the number of nodal domains of Laplace eigenfunctions on chain domains with Neumann boundary conditions. The chain domains consist of a family of planar domains, with piecewise smooth boundary, that are joined by…