Related papers: Basis problem for analytic multiple gaps

Let $\mbox{interval} + k v$, $\mbox{interval} + k e$, and $\mbox{interval} - k e$ denote the classes of graphs that can be obtained from some interval graph by adding $k$ vertices, adding $k$ edges, and deleting $k$ edges, respectively.…

Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…

Let k be a perfect field and A a finite dimensional k-algebra of finite global dimension (e.g. the path algebra of a finite quiver without oriented cycles). Making use of the recent theory of noncommutative motives, we prove that the value…

Given a finite set of integers $A$, its sumset is $A+A:= \{a_i+a_j \mid a_i,a_j\in A\}$. We examine $|A+A|$ as a random variable, where $A\subset I_n = [0,n-1]$, the set of integers from 0 to $n-1$, so that each element of $I_n$ is in $A$…

Let ${\mathcal{M} = (M_i \colon i\in K)}$ be a finite or infinite family consisting of matroids on a common ground set $E$ each of which may be finitary or cofinitary. We prove the following Cantor-Bernstein-type result: If there is a…

A $k$-modal sequence is a sequence of real numbers that can be partitioned into $k+1$ (possibly empty) monotone sections such that adjacent sections have opposite monotonicities. For every positive integer $k$, we prove that any sequence of…

We investigate the connection between bijective, not necessarily finite, set-theoretic solutions of the pentagon equation and Hopf algebras. Firstly, we prove that finite solutions correspond to Hopf algebras with the positive basis…

Given nonnegative integers, $s$ and $k$, an $(s,k)$-polar partition of a graph $G$ is a partition $(A,B)$ of $V_G$ such that $G[A]$ and $\overline{G[B]}$ are complete multipartite graphs with at most $s$ and $k$ parts, respectively. If $s$…

A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seymour and Thomas proved a decomposition theorem for Berge…

We present a natural extension of Andrews' multiple sums counting partitions with difference 2 at distance $k-1$, by deriving the generating function for $K$-restricted jagged partitions. A jagged partition is a collection of non-negative…

We discuss the procedure of different partitions in the finite set of $N$ integer numbers and construct generic formulas for a bijective map of real numbers $s_y$, where $y=1,2,\ldots,N$, $N=\prod \limits_{k=1}^{n} X_k$, and $X_k$ are…

Let $r \geq 2$, $n$ and $k$ be integers satisfying $k \leq \frac{r-1}{r}n$. In the original arXiv version of this note we suggested a conjecture that the family of all $k$-subsets of an $n$-set cannot be partitioned into fewer than $\lceil…

We introduce filtered algebraic $K$-theory of a ring $R$ relative to a sublattice of ideals. This is done in such a way that filtered algebraic $K$-theory of a Leavitt path algebra relative to the graded ideals is parallel to the gauge…

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[n]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [n]$ of $[n]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that $n$ is a multiple of some fixed positive integer $k$. The…

The $k$-deck problem is concerned with finding the smallest positive integer $S(k)$ such that there exist at least two strings of length $S(k)$ that share the same $k$-deck, i.e., the multiset of subsequences of length $k$. We introduce the…

Given a finitely generated algebra $A$, it is a fundamental question whether $A$ has a full rank discrete (Krull) valuation $\mathfrak{v}$ with finitely generated value semigroup. We give a necessary and sufficient condition for this, in…

A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…

We show that every optimum basis of a finite closure system, in D.Maier's sense, is also right-side optimum, which is a parameter of a minimum CNF representation of a Horn Boolean function. New parameters for the size of the binary part are…

Given a finite-dimensional complex Lie algebra g equipped with a nondegenerate, symmetric, invariant bilinear form B, let V_k(g,B) denote the universal affine vertex algebra associated to g and B at level k. For any reductive group G of…