Related papers: Partitioning $\alpha$-large sets for $\alpha<\vare…

Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the well-known Courant's nodal domain theorem on continuous…

In the present paper we are interested in properties of forcing notions which measure in a sense the distance between the ground model reals and the reals in the extension. We look at the ways the ``new'' reals can be aproximated by ``old''…

We show a general decomposition theorem in Baer *-rings. As a consequence the vast majority of decompositions known in the algebra of bounded Hilbert space operators are generalized to Baer *-rings. There are also results which are new in…

C$_{\lambda}$-extended oscillator algebras, where C$_{\lambda}$ is the cyclic group of order $\lambda$, are introduced and realized as generalized deformed oscillator algebras. For $\lambda=2$, they reduce to the well-known…

We prove the Nagata compactification theorem for any separated map of finite type between quasi-compact and quasi-separated algebraic spaces, generalizing earlier results of Raoult. Along the way we also prove (and use) absolute noetherian…

We prove the density of polyhedral partitions in the set of finite Caccioppoli partitions. Precisely, we consider a decomposition $u$ of a bounded Lipschitz set $\Omega\subset\mathbb R^n$ into finitely many subsets of finite perimeter,…

Big Ramsey degrees of Fra\"iss\'e limits of finitely constrained free amalgamation classes in finite binary languages have been recently fully characterised by Balko, Chodounsk\'y, Dobrinen, Hubi\v{c}ka, Kone\v{c}n\'y, Vena, and Zucker. A…

We show that the big Ramsey degrees of every countable universal $u$-uniform $\omega$-edge-labeled hypergraph are infinite for every $u\geq 2$. Together with a recent result of Braunfeld, Chodounsk\'y, de Rancourt, Hubi\v{c}ka, Kawach, and…

Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…

For better learning, large datasets are often split into small batches and fed sequentially to the predictive model. In this paper, we study such batch decompositions from a probabilistic perspective. We assume that data points (possibly…

Formal orbifolds are defined in higher dimension. Their \'etale fundamental groups are also defined. It is shown that the fundamental groups of formal orbifolds have certain finiteness property and it is also shown that they can be used to…

Let $j$ be an elementary embedding of $V_{\lambda}$ into $V_{\lambda}$ that is not the identity, and let $\kappa$ be the critical point of $j$. Let $\Cal A$ be the closure of $\{j\}$ under the operation $a (b)$ of application, and let…

The purpose of this paper is to prove a new general result about rings of complex analytic functions. Let $\Omega$ be an arbitrary nonempty open subset of the complex plane $\mathbb C$, $\mathcal{A}(\Omega)$ be the set of holomorphic…

In this paper, we introduce the concepts of gamma and beta approximations via general ordered topological approximation spaces. Also, increasing (decreasing) gamma and beta boundary, positive and negative regions are given in general…

We continue work on the topology obtained by the convergence $\lambda_{ls}$, which started in \cite{KuPaCZ}, and further investigated in \cite{KuPaFil19}. The main goal is to describe the closed sets and closure operator by the family of…

We study Ramsey like theorems for infinite trees and similar combinatorial tools. As an application we consider the expansion problem for tree algebras.

We present a general procedure for applying the scale-setting prescription of Brodsky, Lepage and Mackenzie to higher orders in the strong coupling constant $\alphas$. In particular, we show how to apply this prescription when the leading…

We build a collection of topological Ramsey spaces of trees giving rise to universal inverse limit structures,extending Zheng's work for the profinite graph to the setting of Fra\"{\i}ss\'{e} classes of finite ordered binary relational…

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a…

We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…