Related papers: On Modal {\mu}-Calculus over Finite Graphs with Bo…

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

Let $\Gamma$ be a cocompact, discrete, and irreducible subgroup of $\mathrm{PSL}_{2}(\mathbb{R})^{n}$. Let $\nu$ be a unitary character of $\Gamma$. For $k\in1\slash 2\,\mathbb{Z}$, let $\sknu$ denote the complex vector space of cusp forms…

We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…

In this work we study an elliptic solid-on-solid model with domain-wall boundaries having the elliptic quantum group $\mathcal{E}_{p, \gamma}[\widehat{\mathfrak{gl}_2}]$ as its underlying symmetry algebra. We elaborate on results previously…

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

Algorithmic meta-theorems explain the tractability of large classes of computational problems by linking logical expressibility with structural graph properties. While extensions of first-order logic such as FO+dp admit efficient model…

Motivated by the theorem of Gy\H ori and Lov\'asz, we consider the following problem. For a connected graph $G$ on $n$ vertices and $m$ edges determine the number $P(G,k)$ of unordered solutions of positive integers $\sum_{i=1}^k m_i = m$…

We study a pair of weakenings of the classical partition relation $\nu \rightarrow (\mu)^2_\lambda$ recently introduced by Bergfalk-Hru\v{s}\'{a}k-Shelah and Bergfalk, respectively. Given an edge-coloring of the complete graph on $\nu$-many…

The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this…

Let $k$, $\lambda$ and $\mu$ be positive integers. A decomposition of a multigraph $ \lambda G$ into edge-disjoint subgraphs $G_1, \ldots , G_k$ is said to be \emph{enclosed} by a decomposition of a multigraph $\mu H$ into edge-disjoint…

The main purpose of this article is to extend some of the ideas from Schubert calculus to the more general setting of Hamiltonian torus actions on compact symplectic manifolds with isolated fixed points. Given a generic component of the…

We show, for any positive integer k, that there exists a graph in which any equitable partition of its vertices into k parts has at least ck^2/\log^* k pairs of parts which are not \epsilon-regular, where c,\epsilon>0 are absolute…

Suppose that $\tilde{G}$ is a connected reductive group defined over a field $k$, and $\Gamma$ is a finite group acting via $k$-automorphisms of $\tilde{G}$ satisfying a certain quasi-semisimplicity condition. Then the connected part of the…

Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…

Driven by many applications in graph analytics, the problem of computing $k$-edge connected components ($k$-ECCs) of a graph $G$ for a user-given $k$ has been extensively studied recently. In this paper, we investigate the problem of…

We show that for any constant $\mu>0$ and $k\ge 3$, there exists $\alpha>0$ such that the following holds for sufficiently large $n \in \mathbb{N}$. If $G=(V_{1},\ldots,V_{k},E)$ is a spanning subgraph of the $n$-blow-up of $K_{k}$ with…

Bhawalkar, Kleinberg, Lewi, Roughgarden, and Sharma [ICALP 2012] introduced the Anchored k-Core problem, where the task is for a given graph G and integers b, k, and p to find an induced subgraph H with at least p vertices (the core) such…

We show that a bounded analytic semigroup on an $L_p$-space has a bounded $H^{\infty}(\Sigma_{\varphi})$-calculus for some $\varphi < \frac{\pi}{2}$ if and only if the semigroup can be obtained, after restricting to invariant subspaces,…

We study the scalar curvature $R$ of the vector moduli space of 5d $\mathcal{N}=1$ supergravities, obtained by compactifying M-theory on a Calabi--Yau three-fold. We find that $R$ can only diverge at points where some gauge interactions go…

A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL) are edge-weighted graphs G and the objective is to find…