Related papers: Counting Condorcet Domains
This paper is concerned with the homogenization of Dirichlet problem of elliptic systems in a bounded, smooth domain of finite type. Both the coefficients of the elliptic operator and the Dirichlet boundary data are assumed to be periodic…
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…
We prove a spanning result for vector-valued Poincar\'e series on a bounded symmetric domain. We associate a sequence of holomorphic automorphic forms to a submanifold of the domain. When the domain is the unit ball in ${\Bbb{C}}^n$, we…
We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…
Consider an eigenvector of the adjacency matrix of a G(n, p) graph. A nodal domain is a connected component of the set of vertices where this eigenvector has a constant sign. It is known that with high probability, there are exactly two…
The class of Boolean combinations of tree languages recognized by deterministic top-down tree automata (also known as deterministic root-to-frontier automata) is studied. The problem of determining for a given regular tree language whether…
We present sufficient conditions so that a conformal map between planar domains whose boundary components are Jordan curves or points has a continuous or homeomorphic extension to the closures of the domains. Our conditions involve the…
Danilov, Karzanov and Koshevoy (2012) geometrically introduced an interesting operation of composition on tiling Condorcet domains and using it they disproved a long-standing problem of Fishburn about the maximal size of connected Condorcet…
We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…
A proper subdomain $G$ of the unit disk $\mathbb{D}$ is horocyclically convex (horo-convex) if, for every $\omega \in \mathbb{D}\cap \partial G$, there exists a horodisk $H$ such that $\omega \in \partial H$ and $G\cap H=\emptyset$. In this…
We study a fundamental question of domain generalization: given a family of domains (i.e., data distributions), how many randomly sampled domains do we need to collect data from in order to learn a model that performs reasonably well on…
Let (L;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of (L;C), i.e., the structures with domain L that are first-order definable in (L;C). We show that up…
We introduce eigencone constellations, a hierarchical framework for embedding bounded-degree spatial graphs into concentric spherical shells and partitioning each shell into spectrally weighted, spherical star-shaped territories. Given a…
Axiomatizing covarieties of coalgebras for an endofunctor is less intuitive than axiomatizing varieties of algebras via equations (Dahlqvist and Schmid, 2022). Existing techniques come from coalgebraic modal logic, pattern avoidance…
Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free…
We are concerned with the analysis of a mean field type equation and its linearization, which is a nonlocal operator, for which we estimate the number of nodal domains for the radial eigenfunctions and the related uniqueness properties.
Existing techniques to adapt semantic segmentation networks across the source and target domains within deep convolutional neural networks (CNNs) deal with all the samples from the two domains in a global or category-aware manner. They do…
In this paper, the characterization of domains in $\mathbb C^n$ by their noncompact automorphism groups are given.
The classification of Fatou components for rational functions was concluded with Sullivan's proof of the No Wandering Domains Theorem in 1985. In 2016 it was shown, in joint work of the first and last author with Buff, Dujardin and Raissy,…
In the present work we present a general framework which guarantees the existence of optimal domains for isoperimetric problems within the class of $C^{1,1}$-regular domains satisfying a uniform ball condition as long as the desired…