Related papers: The closure-complement-frontier problem in saturat…

For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…

An $\mathcal{F}$-saturated $r$-graph is a maximal $r$-graph not containing any member of $\mathcal{F}$ as a subgraph. Let $\mathcal{K}_{\ell + 1}^{r}$ be the collection of all $r$-graphs $F$ with at most $\binom{\ell+1}{2}$ edges such that…

For a given graph $F$, the $F$-saturation number of a graph $G$, denoted by $ {sat}(G, F)$, is the minimum number of edges in an edge-maximal $F$-free subgraph of $G$. In 2017, Kor\'andi and Sudakov determined $ {sat}({G}(n, p), K_r)$…

A Cech closure space $(X,u)$ is a set $X$ with a (Cech) closure operator $u$ which need not be idempotent. Many properties which hold in topological spaces hold in Cech closure spaces as well. The notions of proper (splitting) and…

Let $K$ be a compact set in the complex plane $\C$, such that its complement in the Riemann sphere, $(\C\cup\{\infty\})\sm K$, is connected. Also, let $U\subseteq\C$ be an open set which contains $K$. Then there exists a simply connected…

The main purpose of this paper is to introduce and study two new operators $(\cdot)_R^{\diamond}$ and $cl_R^{\diamond}(\cdot)$ via primal which is a new notion. We also show that the operator $cl_R^{\diamond}(\cdot)$ is a Kuratowski closure…

A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R…

The tower number $\mathfrak t$ and the ultrafilter number $\mathfrak u$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of~$\omega$ and the almost inclusion relation…

According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result…

Let $r\in\mathbb{N}$ and $\mathbb{N}=\bigcup_{i=1}^{r}C_{i}$. Do there exist $x,y\in\mathbb{N}$ and $i\in\left\{1,2,\ldots,r\right\}$ such that $\left\{x,y,xy,x+y\right\}\subseteq C_{i}$? This is still an unanswered question asked by N.…

Consider a planar graph $G=(V,E)$ with polynomially bounded edge weight function $w:E\to [0, poly(n)]$. The main results of this paper are NC algorithms for the following problems: - minimum weight perfect matching in $G$, - maximum…

We show that the knot type of the link of a real analytic map germ with isolated singularity $f\colon(\mathbb{R}^2,0)\to(\mathbb{R}^4,0)$ is a complete invariant for $C^0$-$\mathscr A$-equivalence. Moreover, we also prove that isolated…

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…

We show that for a minimal system $(X,T)$, the set of saturated points along cubes with respect to its maximal $\infty$-step pro-nilfactor $X_\infty$ has a full measure. As an application, it is shown that if a minimal system $(X,T)$ has no…

We define the filtrated K-theory of a C*-algebra over a finite topological space X and explain how to construct a spectral sequence that computes the bivariant Kasparov theory over X in terms of filtrated K-theory. For finite spaces with…

We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…

We prove several versions of Grothendieck's Theorem for completely bounded linear maps $T\colon E \to F^*$, when E and F are operator spaces. We prove that if E,F are $C^*$-algebras, of which at least one is exact, then every completely…

We develop a unified framework for iterated symmetric extensions with countable support and, more generally, with $<\kappa$-support. Set-length iterations are treated uniformly, and when the iteration template is first-order definable over…

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure of a boolean relation (a set of boolean vectors) by…

For each Cantor set C in $R^{3}$, all points of which have bounded local genus, we show that there are infinitely many inequivalent Cantor sets in $R^{3}$ with complement having the same fundamental group as the complement of C. This…