Related papers: An Improved Homomorphism Preservation Theorem From…

Let ${\cal H}(A,B)$ denote the set of homomorphisms from the poset $A$ to the poset $B$. In previous studies, the author has started to analyze what it is in the structure of finite posets $R$ and $S$ that results in $# {\cal H}(P,R) \leq #…

Let $\Gamma$ be either the mapping class group of a closed surface of genus $\geq 2$, or the automorphism group of a free group of rank $\geq 3$. Given any homological representation $\rho$ of $\Gamma$ corresponding to a finite cover, and…

A well-specified parametrization for single-input/single-output (SISO) linear port-Hamiltonian systems amenable to structure-preserving supervised learning is provided. The construction is based on controllable and observable normal form…

We prove that the topological connectivity of a graph homomorphism complex Hom($G,K_m$) is at least $m-D(G)-2$, where $\displaystyle D(G)=\max_{H\subseteq G}\delta(H)$. This is a strong generalization of a theorem of Cuki\'{c} and Kozlov,…

The Subgraph Isomorphism problem is of considerable importance in computer science. We examine the problem when the pattern graph H is of bounded treewidth, as occurs in a variety of applications. This problem has a well-known algorithm via…

Let $\varphi\colon\Gamma\to G$ be a homomorphism of groups. In this paper we introduce the notion of a subnormal map (the inclusion of a subnormal subgroup into a group being a basic prototype). We then consider factorizations…

In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…

Let $k$ be a commutative Noetherian ring and $\underline{\mathscr{C}}$ be a locally finite $k$-linear category equipped with a self-embedding functor of degree 1. We show under a moderate condition that finitely generated torsion…

We introduce the concept of finitely coloured equivalence for unital *-homomorphisms between C*-algebras, for which unitary equivalence is the 1-coloured case. We use this notion to classify *-homomorphisms from separable, unital, nuclear…

By studying cohomology classes that are related with $n$-harmonic morphisms and $F$-harmonic maps, we augment and extend several results on $F$-harmonic maps, harmonic maps in [1, 3, 14], $p$-harmonic morphisms in [17], and also revisit our…

It is well known that the classic {\L}o\'s-Tarski preservation theorem fails in the finite: there are first-order definable classes of finite structures closed under extensions which are not definable (in the finite) in the existential…

We study which classic modal definability and preservation results survive when attention is restricted to finite structures, where many first-order transfer theorems are known to break down. Several semantic characterizations for modal…

The quantified constraint satisfaction problem $\mathrm{QCSP}(\mathcal{A})$ is the problem to decide whether a positive Horn sentence, involving nothing more than the two quantifiers and conjunction, is true on some fixed structure…

We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Constraint satisfaction (CSP) and structure isomorphism (SI) are among the most well-studied computational problems in Computer Science. While neither problem is thought to be in $\texttt{PTIME},$ much work is done on $\texttt{PTIME}$…

We study the problem of existence of a periodic point in the boundary of an invariant domain for a surface homeomorphism. In the area-preserving setting, a complete classification is given in terms of rationality of Carath\'eordory's prime…

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf{PA}$ and intuitionistic arithmetic $\mathsf{HA}$. Using a generalized negative translation, we first…

Given two $n$-element structures, $\mathcal{A}$ and $\mathcal{B}$, which can be distinguished by a sentence of $k$-variable first-order logic ($\mathcal{L}^k$), what is the minimum $f(n)$ such that there is guaranteed to be a sentence $\phi…

We establish a regularity result for optimal sets of the isoperimetric problem with double density under mild ($\alpha$-)H\"older regularity assumptions on the density functions. Our main Theorem improves some previous results and allows to…

We fully characterize the mappings $\Phi$ that send every Pythagorean-hodograph (PH) curve to a PH curve. We prove that in any dimension, such mappings are precisely the conformal functions whose dilation is the square of a real rational…