Related papers: Counting Condorcet Domains
We study the method of finding conformal maps onto circle domains by approximating with finitely connected subdomains. Every domain $D \subset \hat{C}$ admits exhaustions, i.e., increasing sequences of finitely connected subdomains $D_j$…
We introduce a class of group endomorphisms -- those of finite combinatorial rank -- exhibiting slow orbit growth. An associated Dirichlet series is used to obtain an exact orbit counting formula, and in the connected case this series is…
This monograph is an ongoing revision of "Lectures On A Mathematical Theory of Computation" by Dana Scott. Scott's monograph uses a formulation of domains called neighborhood systems in which finite elements are selected subsets of a master…
Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…
Domain generalization (DG) focuses on transferring domain-invariant knowledge from multiple source domains (available at train time) to an, a priori, unseen target domain(s). This requires a class to be expressed in multiple domains for the…
A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits…
First-class constraints constitute a potential obstacle to the computation of a Poisson bracket in Dirac's theory of constrained Hamiltonian systems. Using the pseudoinverse instead of the inverse of the matrix defined by the Poisson…
Single-peaked preferences and domains are extensively researched in social science and economics. In this study, we examine the interval property as well as combinatorial structure of single-peaked preferences on a fixed Left-Right social…
The Poisson boundary of a finite direct product of affine automorphism groups of homogeneous trees is considered. The Poisson boundary is shown to be a product of ends of trees with a hitting measure for spread-out, aperiodic measures of…
It is known that automorphisms of quasi-circular domains fixing the origin are polynomial mappings. By introducing the so-called resonance order and quasi-resonance order, we provide a uniform upper bound for the degree of such polynomial…
For a smoothly bounded pseudoconvex domain $D\subset{\Bbb C}^n$ of finite type with non-compact holomorphic automorphism group $\text{Aut}(D)$, we show that the set $S(D)$ of all boundary accumulation points for $\text{Aut}(D)$ is a compact…
Domain generalization addresses domain shift in real-world applications. Most approaches adopt a domain angle, seeking invariant representation across domains by aligning their marginal distributions, irrespective of individual classes,…
An integral domain $R$ is called atomic if every nonzero nonunit of $R$ factors into irreducibles, while $R$ satisfies the ascending chain condition on principal ideals if every ascending chain of principal ideals of $R$ stabilizes. It is…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
We study the automorphisms group action on a bounded domain in $\CC^n$ having a boundary point that is exponentially flat. Such a domain typically has a compact automorphism group. Our results enable us to generate many new examples.
We study here constraint satisfaction problems that are based on predefined, explicitly given finite constraints. To solve them we propose a notion of rule consistency that can be expressed in terms of rules derived from the explicit…
Necessary and sufficient geometric conditions are given for domains with regular boundary points and edges to be domains of holomorphy provided the remainder boundary subset is of zero Hausdorff 1-codimensional measure.
Domain generalization involves learning a classifier from a heterogeneous collection of training sources such that it generalizes to data drawn from similar unknown target domains, with applications in large-scale learning and personalized…
We investigate the new, Turing-complete class of layered systems, whose lefthand sides of rules can only be overlapped at a multiset of disjoint or equal positions. Layered systems define a natural notion of rank for terms: the maximal…
The paper is concerned with the boundary behaviour of polynomially and rationally convex hulls in pseudoconvex domains in $\mathbb{C}^n$. As an application, it is shown that every connected polynomially or rationally convex compact set with…