Related papers: A composition of Condorcet domains
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum…
This paper is the first part of our series work to establish pointwise second-order necessary conditions for stochastic optimal controls. In this part, both drift and diffusion terms may contain the control variable but the control region…
We construct several families of perfect sublattices with minimum $4$ of $\mathbb Z^d$. In particular, the number of $d-$dimensional perfect integral lattices with minimum $4$ grows faster than $d^k$ for every exponent $k$.
Bieberbach constructed in 1933 domains in $ \bf {C}^2$ which were biholomorphic to $ \bf {C}^2$ but not dense. The existence of such domains was unexpected. The special domains Bieberbach considered are basins of attraction of a cubic…
In this note we give a new sufficient condition for the boundedness of the composition operator on the Dirichlet-type space on the disc, via a two dimensional change of variables formula. With the same formula, we characterise the bounded…
We study domains in complex $n$-space with automorphism group that does not depend on the full $n$ dimensions of the ambient space. A sufficient geometric condition is obtained to guarantee that a domain has such a "thin" automorphism…
We study the monodromy groups of compositions of two indecomposable polynomials. In particular, we show that such monodromy groups either fulfill a certain "largeness" property, or are in an explicit list of exceptions. Such largeness…
We study the composition of two set-valued functions defined on locally convex topological linear spaces. We assume that these functions map into certain complete lattices of sets that have been used to establish a conjugation theory for…
A subset of vertices is a {\it maximum independent set} if no two of the vertices are adjacent and the subset has maximum cardinality. A subset of vertices is called a {\it maximum dissociation set} if it induces a subgraph with vertex…
We consider the degrees of the elements of a homogeneous system of parameters for the ring of invariants of a binary form, give a divisibility condition, and a complete classification for forms of degree at most 8.
We examine dynamical systems with the property that pseudo-orbits can be traced by small diameter sets with bounded cardinality. In particular, we show that mixing sofic subshifts and surjective dynamical systems with the specification…
Domain theory has its origins in Mathematics and Theoretical Computer Science. Mathematically it combines order and topology. Its central concepts have their origin in the idea of approximating ideal objects by their relatively finite or,…
Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…
Let $H$ be a separable Hilbert space, $A_c:\mathcal D_c\subset H\to H$ a densely defined unbounded operator, bounded from below, let $\mathcal D_{\min}$ be the domain of the closure of $A_c$ and $\mathcal D_{\max}$ that of the adjoint.…
We show that the maximum number of minimum dominating sets of a forest with domination number $\gamma$ is at most $\sqrt{5}^{\gamma}$ and construct for each $\gamma$ a tree with domination number $\gamma$ that has more than…
In this paper we obtain new obstructions to symplectic embeddings of the four-dimensional polydisk $P(a,1)$ into the ball $B(c)$ for $2\leq a<\frac{\sqrt{7}-1} {\sqrt{7}-2} \approx 2.549$, extending work done by Hind-Lisi and Hutchings.…
In this paper, we revisit the nonoverlapping domain decomposition methods for solving elliptic problems with high contrast coefficients. Some interesting results are discovered. We find that the Dirichlet-Neumann algorithm and Robin-Robin…
We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…
We deal with Orlicz-Sobolev embeddings in open subsets of $\mathbb{R}^n$. A necessary and sufficient condition is established for the existence of an optimal, i.e. largest possible, Orlicz-Sobolev space continuously embedded into a given…
Consider the set of Borel probability measures on $\mathbf{R}^k$ and endow it with the topology of weak convergence. We show that the subset of all probability measures which belong to the domain of attraction of some multivariate extreme…