Related papers: Parameterized stratification and piece number of D…
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…
Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simple as path or tree decompositions, such dynamic programming…
We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it…
Given a graph $G = (V,E)$, a threshold function $t~ :~ V \rightarrow \mathbb{N}$ and an integer $k$, we study the Harmless Set problem, where the goal is to find a subset of vertices $S \subseteq V$ of size at least $k$ such that every…
The subject of investigations are the almost hypercomplex manifolds with Hermitian and anti-Hermitian (Norden) metrics. A linear connection D is introduced such that the structure of these manifolds is parallel with respect to D and its…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
We define Leavitt path algebras of hypergraphs generalizing simultaneously Leavitt path algebras of finitely separated graphs and Leavitt path algebras of row-finite vertex-weighted graphs. We find linear bases for those algebras, compute…
The d-measurement set of a graph is its set of possible squared edge lengths over all d-dimensional embeddings. In this note, we define a new notion of graph isomorphism called d-measurement isomorphism. Two graphs are d-measurement…
The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…
In this work we study a classic generalization of the Vertex Cover (VC) problem, called the Component Order Connectivity (COC) problem. In COC, given an undirected graph $G$, integers $d \geq 1$ and $k$, the goal is to determine if there is…
Extending the work of the first author, we introduce a notion of semisimple topological field theory in arbitrary even dimension and show that such field theories necessarily lead to stable diffeomorphism invariants. The main result of this…
Closed subschemes in projective space with a fixed Hilbert polynomial are parametrized by a Hilbert scheme. We classify the smooth ones. We identify numerical conditions on a polynomial that completely determine when the Hilbert scheme is…
Let $K$ be a complete discrete valuation field. Let $\mathcal{O}_K$ be its ring of integers. Let $k$ be its residue field which we assume to be algebraically closed of characteristic exponent $p\geq1$. Let $G/K$ be a semi-abelian variety.…
We study the \'etale sheafification of algebraic K-theory, called \'etale K-theory. Our main results show that \'etale K-theory is very close to a noncommutative invariant called Selmer K-theory, which is defined at the level of categories.…
A {\bf strong arc decomposition} of a digraph $D=(V,A)$ is a partition of its arc set $A$ into two sets $A_1,A_2$ such that the digraph $D_i=(V,A_i)$ is strong for $i=1,2$. Bang-Jensen and Yeo (2004) conjectured that there is some $K$ such…
For any real-analytic hypersurface M in complex euclidean space of dimension >= 2 which does not contain any complex-analytic subvariety of positive dimension, we show that for every point p in M the local real-analytic CR automorphisms of…
In this paper, we consider the embedding of a complete $d$-uniform geometric hypergraph with $n$ vertices in general position in $\mathbb{R}^d$, where each hyperedge is represented as a $(d-1)$-simplex, and a pair of hyperedges is defined…
Let X be a normal connected complex algebraic variety equipped with a semisimple complex representation of its fundamental group. Then, under a maximality assumption, we prove that the covering space of X associated to the kernel of the…
In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$. We study the problem's (in-)approximability and offer improvements and extensions of…
Some filter relative notions of size, $\left( \mathcal{F},\mathcal{G}\right) $-syndeticity and piecewise $\mathcal{F} $-syndeticity, were defined and applied with clarity and focus by Shuungula, Zelenyuk and Zelenyuk in their paper ``The…