Related papers: Symmetric Submodular Functions, Uncrossable Functi…
Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…
A space $X$ is M-separable (selectively separable) (Scheepers, 1999; Bella et al., 2009) if for every sequence $(Y_n)$ of dense subspaces of $X$ there exists a sequence $(F_n)$ such that for each $n$ $F_n$ is a finite subset of $Y_n$ and…
Admissible pairs $((\widetilde S, \widetilde L), \widetilde E)$ consisting of an $N$-dimensional projective scheme~$\widetilde S$ of certain class with a special ample invertible sheaf $\widetilde L$ and a locally free ${\cal O}_{\widetilde…
A subset $M \subset \textbf{R}^3$ is called a \emph{basic subset}, if for any funciton $f \colon M \to \textbf{R}$ there exist such functions $f_1; f_2; f_3 \colon \textbf{R} \to \textbf{R}$ that $f(x_1, x_2, x_3) = f_1(x_1) + f_2(x_2) +…
It is well known that two-dimensional fermionic systems with a nonzero Chern number must break the time reversal symmetry, manifested by the appearance of chiral edge modes on an open boundary. Such an incompatibility between topology and…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…
A permutation class $C$ is said to be splittable if there exist two proper subclasses $A, B \subsetneq C$ such that any $\sigma \in C$ can be red-blue colored so that the red (respectively, blue) subsequence of $\sigma$ is order isomorphic…
The basic (and traditional) crossing number problem is to determine the minimum number of crossings in a topological drawing of an input graph in the plane. We develop a unified framework yielding fixed-parameter tractable (FPT) algorithms…
Submodular functions and variants, through their ability to characterize diversity and coverage, have emerged as a key tool for data selection and summarization. Many recent approaches to learn submodular functions suffer from limited…
In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…
A morphism of the moduli functor of admissible semistable pairs to the Gieseker -- Maruyama moduli functor (of semistable coherent torsion-free sheaves) with the same Hilbert polynomial on the surface, is constructed. It is shown that these…
Motivated by the recent work of Kulikov, Nazarov, and Sodin, we construct sufficient conditions for discrete subsets of $\mathbb{R}$, which lie between the supercritical and subcritical cases, to constitute Fourier uniqueness pairs. This…
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…
A topological space is called {\it dense-separable} if each dense subset of its is separable. Therefore, each dense-separable space is separable. We establish some basic properties of dense-separable topological groups. We prove that each…
In this paper we examine on a pair of adjoint functors $(\phi ^{\ast},\phi_{\ast})$ for a subcategory of the category of crossed modules over commutative algebras where $\phi ^{\ast}:\mathbf{XMod}$\textbf{/}$% Q\rightarrow $…
An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.
It is known that finite crossed modules provide premodular tensor categories. These categories are in fact modularizable. We construct the modularization and show that it is equivalent to the module category of a finite Drinfeld double.
We discuss some notions of compactness and convergence relative to a specified family F of subsets of some topological space X. The two most interesting particular cases of our construction appear to be the following ones. (1) The case in…