Related papers: Craig Interpolation for Guarded Fragments

The extension complexity $\mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let…

This article studies the \emph{$k$-forcing number} for oriented graphs, generalizing both the \emph{zero forcing number} for directed graphs and the $k$-forcing number for simple graphs. In particular, given a simple graph $G$, we introduce…

Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated function system (IFS) corresponding to the data set is the graph of the FIF. Coalescence…

We study the complexity of the problems of finding, given a graph $G$, a largest induced subgraph of $G$ with all degrees odd (called an odd subgraph), and the smallest number of odd subgraphs that partition $V(G)$. We call these parameters…

We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[<] for omega-languages: Sigma_2, FO^2, the intersection of FO^2 and Sigma_2, and Delta_2 (and…

The packing chromatic number $\chi_\rho(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set $V(G)$ can be partitioned into disjoint classes $X_1, ..., X_k$, where vertices in $X_i$ have pairwise distance greater than…

In the context of graphene-based composite applications, a complete understanding of charge conduction in multilayer reduced graphene oxides (rGO) is highly desirable. However, these rGO compounds are characterized by multiple and different…

Given a graph $G$, the maximum size of an induced subgraph of $G$ each component of which is a star is called the edge open packing number, $\rho_{e}^{o}(G)$, of $G$. Similarly, the maximum size of an induced subgraph of $G$ each component…

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

Let G be a connected reductive group and X an equivariant compactifiction of G. In X, we study generalised and opposite generalised Schubert varieties, their intersections called generalised Richardson varieties and projected generalised…

We show that the variety of modal lattices has the superamalgamation property. As a consequence, we obtain that the weak positive modal logic has the Craig interpolation property. Our proof employs the recent duality for modal lattices…

The present paper considers multipartite graphs from the perspective of design theory and coding theory. A one-factor $F$ of the complete multipartite graph $K_{n\times g}$ (with $n$ parts of size $g$) gives rise to a $(g+1)$-ary code…

Graph pooling has been increasingly recognized as crucial for Graph Neural Networks (GNNs) to facilitate hierarchical graph representation learning. Existing graph pooling methods commonly consist of two stages: selecting top-ranked nodes…

For a given d-minimal expansion $\mathfrak R$ of the ordered real field, we consider the expansion $\mathfrak R^\natural$ of $\mathfrak R$ generated by the sets of the form $\bigcup_{S \in \mathcal C}S$, where $\mathcal C$ is a subfamily of…

The packing chromatic number $\chi$ $\rho$ (G) of a graph G is the smallest integer k such that its set of vertices V (G) can be partitioned into k disjoint subsets V 1 ,. .. , V k , in such a way that every two distinct vertices in V i are…

Consider a finite dimensional (generally reducible) polynomial representation \rho of GL_n. A projective compactification of GL_n is the closure of \rho(GL_n) in the space of all operators defined up to a factor (this class of spaces can be…

If a $p$-adic Galois representation $\rho_{f,\nu}:\Gamma_{\mathbb Q} \to \GL_2(E_{f,\nu})$ attached to some eigenform $f$ is residually reducible it will have 2 non-isomorphic reductions, which have the same semi-simplification. In this…

The \textit{packing chromatic number} of a graph $G$, denoted by $% \chi_\rho(G)$, is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_i$, $i\in \{1,\ldots,k\}$, where each $V_i$ is an $i$-packing. In…

The increasing popularity of automated tools for software and hardware verification puts ever increasing demands on the underlying decision procedures. This paper presents a framework for distributed decision procedures (for first-order…

Given $p$ node pairs in an $n$-node graph, a distance preserver is a sparse subgraph that agrees with the original graph on all of the given pairwise distances. We prove the following bounds on the number of edges needed for a distance…