Related papers: An Orchard Theorem

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees. Our theorem has a number of…

Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…

Existing ordinal trees and random forests typically use scores that are assigned to the ordered categories, which implies that a higher scale level is used. Versions of ordinal trees are proposed that take the scale level seriously and…

Ornaments aim at taming the multiplication of special-purpose datatype in dependently-typed theory. In its original form, the definition of ornaments is tied to a particular universe of datatypes. Being a type theoretic object,…

We construct a functor, from the category of schemes to the category of graded rings, that is an initial object for having a theory of Chern classes with an additive first Chern class. For any scheme $X$, the graded ring that our functor…

We expose a rather simple and direct approach to the structure theory of prime PI-rings ("Posner's theorem"), based on fundamental properties of the extended centroid of a prime ring.

We generalise the construction of infinite matroids from trees of matroids to allow the matroids at the nodes, as well as the field over which they are represented, to be infinite.

We give a criterion when an expansion of the ordered set of real numbers defines the image of the expansion of the real field by the set of natural numbers under a semialgebraic injection. In particular, we show that for a non-quadratic…

We introduce and study the class of spherically ordered groups. The notions of spherically ordered groups and their spectra of spherical orderability are introduced. Values of these spectra are found for a series of natural groups.

To any rooted tree, we associate a sequence of numbers that we call the logarithmic factorials of the tree. This provides a generalization of Bhargava's factorials to a natural combinatorial setting suitable for studying questions around…

We develop a theory of semidirect products of partial groups and localities. Our concepts generalize the notions of direct products of partial groups and localities, and of semidirect products of groups.

In connection with the emerging theory of Garside categories, we develop the notions of a left-Garside category and of a locally left-Garside monoid. In this framework, the connection between the self-distributivity law LD and braids…

This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…

Phylogenetic networks are used to represent evolutionary scenarios in biology and linguistics. To find the most probable scenario, it may be necessary to compare candidate networks, to distinguish different networks, and to see when one…

It is useful to have a criterion for when the predictions of an operational theory should be considered classically explainable. Here we take the criterion to be that the theory admits of a generalized-noncontextual ontological model.…

We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…

It seems reasonable that a toroid can be thought of approximately as a solenoid bent into a circle. The correspondence of the inductances of these two objects gives an approximation for the natural logarithm in terms of the average of two…

We give a simple proof of Dorronsoro's theorem and use similar ideas to establish an equivalence for embeddings of vector fields.

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…