Related papers: Comment to "Almost disjoint sets, the dense set pr…

We provide a numerical refutation of the developments of Fiorini et al. (2015)* for models with disjoint sets of descriptive variables. We also provide an insight into the meaning of the existence of a one-to-one linear map between…

We briefly remind references and arguments, already discussed in the past, which confute erroneous claims in arXiv:1210.5501.

This short note, in part of expository nature, points out several new or recent consequences of a quite nice decomposition for positive semi-definite matrices.

Set-disjointness problems are one of the most fundamental problems in communication complexity and have been extensively studied in past decades. Given its importance, many lower bound techniques were introduced to prove communication lower…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

This note replies Dr. Jensen (2010) comments on Problem 2.3, which was left in Fuh (2010). In the following, we use the same notations and definitions in Fuh (2006) unless specified.

We prove relative versions of many earlier results about almost invariant sets and splittings of groups. In particular, we prove a relative version of the algebraic torus theorem, and we prove the existence and uniqueness of relative…

In this paper we replay the definitions, constructions and results from [SIAM J. Sci. Comp., 37(3)(2015), A1248-A1269] by completing and developing some of them to inconsistent least squares problems.

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…

It is well-known that tensor decompositions show separations, that is, that constraints on local terms (such as positivity) may entail an arbitrarily high cost in their representation. Here we show that many of these separations disappear…

We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…

In this paper, we present, given a odd integer $d$, a decomposition of the multiset of bar lengths of a bar partition $\lambda$ as the union of two multisets, one consisting of the bar lengths in its $\bar{d}$-core partition…

We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…

A corrigendum of a former result on semisimplicity of the category of integrable modules of a q-boson algebra is given with a counter example.

This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…

We give a brief account on a basic result (Lemma \ref{lem2}) which is a very useful tool in proving various convergence theorems in the framework of the iterative approximation of fixed points of demicontractive mappings in Hilbert spaces.…

This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers $n,k$ and $p_1\le p_2\le \cdots\le p_k$ such that $p_1+\cdots+p_k=n$ and $k$ divides $\sum_{i=1}^ni$, we study…

We recall some classical results relating normality and some natural weakenings of normality in $\Psi$-spaces over almost disjoint families of branches in the Cantor tree to special sets of reals like $Q$-sets, $\lambda$-sets and…

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…