Related papers: A nonstandard proof for Szpilrajn's theorem

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

We extend the integrability analysis for scalar evolution equations of type $$u_t=u_m+f(u,u_1,...,u_{m-1})$$ from the case that the right hand side is a $\lambda$-homogeneous formal power series to the case that it is a nonhomogeneous…

Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…

A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…

Motivated by Cuntz-Krieger-Toeplitz systems associated to undirected graphs and representations of groupoids, we obtain a generalisation of the Sz-Nagy's Dilation Theorem for operator valued partially positive semidefinite maps on…

One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

The set of triangulations of a cyclic polytope possesses two a priori different partial orders, known as the higher Stasheff-Tamari orders. The first of these orders was introduced by Kapranov and Voevodsky, while the second order was…

The subject of these Notes is the new proof, proposed in [F. H{\'e}lein, In{\'e}galit{\'e} isop{\'e}rim{\'e}trique et calibrations, Annales de l'Institut Fourier 44, 4 (1994), 1211-1218] of the classical isoperimetric inequality in the…

We consider a family of distributions on which natural tail orders can be constructed upon a representation of a distribution by a (single) hyper-real number. Past research revealed that the ordering can herein strongly depend on the…

In 1956, 48 years after Hausdorff provided a comprehensive account on ordered sets and defined the notion of a scattered order, Erd\H{o}s and Rado founded the partition calculus in a seminal paper. The present paper gives an account of…

In this paper we generalize Nesterenko's criterion to the case where the small linear forms have an oscillating behaviour (for instance given by the saddle point method). This criterion provides both a lower bound for the dimension of the…

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that this statement holds whenever $|A| \leq e^{c(\log…

We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…

If X is a non-empty subset of a finite group G, we denote by o(x) the order of x in G. Then we put The number o(X) is called the average order of X. Zapirain in 2011 , posed the following question: Let G be a finite (p-) group and N a…

We introduce the concept of {\it self-referential order} which provides a way to quantify structural organization in non crystalline materials. The key idea consists in the observation that, in a disordered system, where there is no ideal,…

We present a construction of a certain infinite complete partial order (CPO) that differs from the standard construction used in Scott's denotational semantics. In addition, we construct several other infinite CPO's. For some of those, we…

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…