Related papers: Weakly binary expansions of dense meet-trees

Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. The cardinality of a smallest super…

We construct a model structure on the category of small categories enriched over a combinatorial closed symmetric monoidal model category satisfying the monoid axiom. Weak equivalences are Dwyer-Kan equivalences, i.e. enriched functors…

A tree with $n$ vertices has at most $95^{n/13}$ minimal dominating sets. The growth constant $\lambda = \sqrt[13]{95} \approx 1.4194908$ is best possible. It is obtained in a semi-automatic way as a kind of "dominant eigenvalue" of a…

We continue the study of the representation theory of a regular weak multiplier bialgebra with full comultiplication, started in arXiv:1306.1466, arXiv:1311.2730. Yetter-Drinfeld modules are defined as modules and comodules, with…

We establish extension theorems for separately holomorphic mappings defined on sets of the form W\setminus M with values in a complex analytic space which possesses the Hartogs extension property. Here W is a 2-fold cross of arbitrary…

We give a definition of weak morphism of $T$-algebras, for a $2$-monad $T$, with respect to an arbitrary family $\Omega$ of $2$-cells of the base $2$-category. By considering particular choices of $\Omega$, we recover the concepts of lax,…

Domination theory has been studied extensively in the context of binary monotone systems, where the structure function is a sum of products of the component state variables, and with coefficients given by the signed domination function.…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

We work out some relations between duality and intertwining in the context of discrete Markov chains, fixing up the background of previous relations first established for birth and death chains and their Siegmund duals. In view of the…

By doubling the target space of a canonical Courant algebroid and subsequently projecting down to a specific subbundle, we identify the data of double field theory (DFT) and hence define its algebroid structure. We specify the properties of…

Open fermion systems with energy-independent bilinear coupling to a fermionic environment have been shown to obey a general duality relation [Phys. Rev. B 93, 81411 (2016)] which allows for a drastic simplification of time-evolution…

We consider the set of polygons all of whose sides are vertical or horizontal with fixed combinatorics (for example all the figure "L"s). We show that there is a dense G $\delta$ subset of such polygons such that for each polygon in this G…

Joint statistics of periods and mass ratios of close binaries and its dependence on primary mass can be explained by assuming that seed binary companions are formed by disc fragmentation at random intervals during assemblage of stellar mass…

We show that in a typical polygon the billiard map as well as its associated subshift obtained by coding orbits by the sequence of sides they visit are topologically weakly mixing.

We show that some recent constructions in the literature, named `weak' generalizations, can be systematically treated by passing from 2-categories to categories enriched in the Cartesian monoidal category of Cauchy complete categories.

We study the representation theory of the increasing monoid. Our results provide a fairly comprehensive picture of the representation category: for example, we describe the Grothendieck group (including the effective cone), classify…

In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that…

In this paper, we prove first that the iterates of a mean nonexpansive map defined on a weakly compact, convex set converge weakly to a fixed point in the presence of Opial's property and asymptotic regularity at a point. Next, we prove the…

We investigate the reverse mathematics strength of Martin's pointed tree theorem (MPT) and one of its variants, weak Martin's pointed tree theorem (wMPT).

There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional evidence in favor of this theory by showing that several…