Related papers: The Solecki dichotomy for functions with analytic …

A new summation method is introduced to convert a relatively wide family of infinite sums and local expansions into integrals. The integral representations yield global information such as analytic continuability, position of singularities,…

Tibor Gallai conjectured that the edge set of every connected graph $G$ on $n$ vertices can be partitioned into $\lceil n/2\rceil$ paths. Let $\mathcal{G}_{k}$ be the class of all $2k$-regular graphs of girth at least $2k-2$ that admit a…

We present a useful technique of proving strong $\mathfrak{c}$-algebrability. As an outcome we obtain the strong $\mathfrak{c}$-algebrability of the following sets of functions: strong Sierpi\'nski-Zygmund, nowhere H\"older, Bruckner-Garg,…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

We investigate strongly separately continuous functions on a product of topological spaces and prove that if $X$ is a countable product of real lines, then there exists a strongly separately continuous function $f:X\to\mathbb R$ which is…

A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most…

We study M-separability as well as some other combinatorial versions of separability. In particular, we show that the set-theoretic hypothesis b=d implies that the class of selectively separable spaces is not closed under finite products,…

A topological space $X$ is called Piotrowski if every quasicontinuous map $f:Z\to X$ from a Baire space $Z$ to $X$ has a continuity point. In this paper we survey known results on Piotrowski spaces and investigate the relation of Piotrowski…

In mathematics education research, mathematics task sets involving mixed practice include tasks from many different topics within the same assignment. In this paper, we use graph decompositions to construct mixed practice task sets for…

We develop a new, intrinsic, computationally friendly approach to Lie coalgebras through graph coalgebras, which are new and likely to be of independent interest. Our graph coalgebraic approach has advantages both in finding relations…

This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…

Using Laurent decomposition and Mergelyan's theorem combined with Baire's category theorem, we prove generic nowhere differentiability on the distinguished boundary of functions of analytic type on products of planar domains bounded by…

The Lojasiewicz inequalities for real analytic functions on Euclidean space were first proved by Stanislaw Lojasiewicz (1965) using methods of semianalytic and subanalytic sets, arguments later simplified by Bierstone and Milman (1988). In…

In this paper K closedness is proved in the case of the couple of real Hardy spaces in the corresponding couple of Lebesgue spaces. This means roughly that any measurable decomposition of an analytic function gives rise to an "analytic"…

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…

A celebrated 1922 theorem of Kuratowski states that there are at most 14 distinct sets arising from applying the operations of complementation and closure, any number of times, in any order, to a subset of a topological space. In this paper…

Let X be a separable Banach space which admits a separating polynomial; in particular X a separable Hilbert space. Let $f:X \rightarrow R$ be bounded, Lipschitz, and $C^1$ with uniformly continuous derivative. Then for each {\epsilon}>0,…

Gallai's path decomposition conjecture states that the edges of any connected graph on n vertices can be decomposed into at most (n+1)/2 paths. We confirm that conjecture for all graphs with maximum degree at most five.

A locally checkable labeling problem (LCL) on a group $\Gamma$ asks one to find a labeling of the Cayley graph of $\Gamma$ satisfying a fixed, finite set of "local" constraints. Typical examples include proper coloring and perfect matching…

Let $M=I$ or $M=\mathbb{S}^1$ and let $k\geq 1$. We exhibit a new infinite class of Polish groups by showing that each group $\mathop{\rm Diff}_+^{k+AC}(M)$, consisting of those $C^k$ diffeomorphisms whose $k$-th derivative is absolutely…