Related papers: A partition theorem for scattered order types
We show that (in ZFC) every infinite set S can be equipped with 2^|S| complete metrics which generate mutually non-homeomorphic scattered order topologies on S. Furthermore, we show that (in ZFC) every uncountable set S can be equipped with…
We prove combinatorial theorems concerning the stick principle and cardinal characteristics.
The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…
A finite group $G$ is called $\psi$-divisible if $\psi(H)|\psi(G)$ for any subgroup $H$ of $G$, where $\psi(H)$ and $\psi(G)$ are the sum of element orders of $H$ and $G$, respectively. In this paper, we extend a result provided in [10], by…
Nonequilibrium behaviors of positional order are discussed based on diffusion processes in particle systems. With the cumulant expansion method up to the second order, we obtain a relation between the positional order parameter $\Psi$ and…
Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's…
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
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…
Assuming that $0^\dagger$ does not exist, we prove that if there is a partition of $\mathbb R$ into $\aleph_\omega$ Borel sets, then there is also a partition of $\mathbb R$ into $\aleph_{\omega+1}$ Borel sets.
Scale invariant scattering suggests that all Bernoulli numbers B_{2n} can be naturally partitioned, i.e., written as particular finite sums of same-signed, monotonic, rational numbers. Some properties of these rational numbers are discussed…
A distributed order fractional diffusion equation is considered. Distributed order derivatives are fractional derivatives that have been integrated over the order of the derivative within a given range. In this paper sub-diffusive cases are…
A new dispersion relation for the partial wave $\pi\pi$ scattering $S$ matrix is set up. Using the dispersion relation we generalize the single channel unitarity condition, $SS^+=1$, to the entire complex $s$ plane, which is equivalent to…
We prove that, e.g., if mu >cf(mu)= aleph_0 and mu>2^{aleph_0} and every stationary family of countable subsets of mu^+ reflect in some subset of mu^+ of cardinality aleph_1, then the SCH for mu^+ (moreover, for mu^+, any scale for mu^+ has…
In this expository article, we highlight the direct connection between card shuffling and the functions known as $P$-partitions that come from algebraic combinatorics. While many (but not all) of the results we discuss are known, we give a…
Categories of partial functions have become increasingly important principally because of their applications in theoretical computer science. In this note we prove that the category of partial bijections between sets as an…
Computability relative to a partial function $f$ on the natural numbers can be formalized using the notion of an oracle for this function $f$. This can be generalized to arbitrary partial combinatory algebras, yielding a notion of…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
The plethysm coefficient $p(\nu, \mu, \lambda)$ is the multiplicity of the Schur function $s_\lambda$ in the plethysm product $s_\nu \circ s_\mu$. In this paper we use Schur--Weyl duality between wreath products of symmetric groups and the…
An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…