Related papers: Grationality, With a Spoon
Fractional supersymmetry denotes a generalisation of supersymmetry which may be constructed using a single real generalised Grassmann variable, $\theta = \bar{\theta}, \, \theta^n = 0$, for arbitrary integer $n = 2, 3, ...$. An explicit…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain.…
In this paper, we use analysis on graphs to study quantitative measures of segregation. We focus on a classical statistic from the geography and urban sociology literature known as Moran's I, which in our language is a score associated to a…
A topological disc is called $n$-self-affine if it has a dissection into $n$ affine images of itself. It is called $n$-gc-self-affine if the dissection is obtained by successive glass-cuts, which are cuts along segments splitting one disc…
The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…
Let $\Gamma$ be the fundamental group of a manifold modeled on three dimensional Sol geometry. We prove that $\Gamma$ has a finite index subgroup $G$ which has a rational growth series with respect to a natural generating set. We do this by…
A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
We show that main results of rational trigonometry (as developed by NJ Wildberger, "Divine Proportions", 2005) can be succinctly expressed using projective geometric algebra (PGA). In fact, the PGA representation exhibits distinct…
We prove an effective bound for the degree of a smooth divisor of a hypersurface of P^n, n>4 (projective space over an algebraically closed field of characteristic zero). Our result follows from a strong (since the degree of the divisor is…
Composing with the inclusion $\mathsf{Set}\to\mathsf{Cat} $, a graph $G$ internal to $\mathsf{Set} $ becomes a graph of discrete categories, the coinserter of which is the category freely generated by $G$. Introducing a suitable definition…
We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…
Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…
We introduce a class of normal complex spaces having only mild sin-gularities (close to quotient singularities) for which we generalize the notion of a (analytic) fundamental class for an analytic cycle and also the notion of a relative…
Math is widely considered as a powerful tool and its strong appeal depends on the high level of abstraction it allows in modelling a huge number of heterogeneous phenomena and problems, spanning from the static of buildings to the flight of…
In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that…
Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…
The cross-ratio degree problem counts configurations of n points on P^1 with n-3 prescribed cross-ratios. Cross-ratio degrees arise in many corners of combinatorics and geometry, but their structure is not well-understood in general.…
In this article, gentle algebras are realised as tiling algebras, which are associated to partial triangulations of unpunctured surfaces with marked points on the boundary. This notion of tiling algebras generalise the notion of Jacobian…