Related papers: Grationality, With a Spoon
We establish an Excision type theorem for niceness of group structure on the orbit space of unimodular rows of length $n$ modulo elementary action. This permits us to establish niceness for relative versions of results for the cases when $n…
Many things in mathematics seem lamost unreasonably nice. This includes objects, counterexamples, proofs. In this preprint I discuss many examples of this phenomenon with emphasis on the ring of polynomials in a countably infinite number of…
In this paper we will do the following: (1) show how to geometrically define multiplication, using only basic plane geometry, independently of area and any notion of similar triangles; (2) prove all the properties of multiplication using…
We consider simple rational functions $R_{mn}(x)=P_m(x)/Q_n(x)$, with $P_m$ and $Q_n$ polynomials of degree $m$ and $n$ respectively. We look for "nice" functions, which we define to be ones where as many as possible of the roots, poles,…
An $n$-vertex tree $T$ is said to be $\textit{graceful}$ if there exists a bijective labelling $\phi:V(T)\to \{1,\ldots,n\}$ such that the edge-differences $\{|\phi(x)-\phi(y)| : xy\in E(T)\}$ are pairwise distinct. The longstanding…
We study the computational complexity of fair division of indivisible items in an enriched model: there is an underlying graph on the set of items. And we have to allocate the items (i.e., the vertices of the graph) to a set of agents in…
Conceived and developed by Christopher Alexander through his life's work: The Nature of Order, wholeness is defined as a mathematical structure of physical space in our surroundings. Yet, there was no mathematics, as Alexander admitted…
A graceful n-permutation is a graceful labeling of an n-vertex path P_n. In this paper we improve the asymptotic lower bound on the number of such permutations from (5/3)^n to 2.37^n. This is a computer-assisted proof based on an effective…
Orthogonal arrays are arguably one of the most fascinating and important statistical tools for efficient data collection. They have a simple, natural definition, desirable properties when used as fractional factorials, and a rich and…
The concept of a nice basis for a Lie algebra was introduced to study the Ricci curvature on nilpotent Lie groups equipped with a left-invariant metric. Despite the many applications in differential geometry, for example in the construction…
This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
Mathematical research is often motivated by the desire to reach a beautiful result or to prove it in an elegant way. Mathematician's work is thus strongly influenced by his aesthetic judgments. However, the criteria these judgments are…
One source of beauty in mathematics is totally unexpected connections between two fundamentally different objects. For instance, is it not surprising that the time period of a real simple pendulum is linked with a function arising out of…
We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…
We study a resource allocation setting where $m$ discrete items are to be divided among $n$ agents with additive utilities, and the agents' utilities for individual items are drawn at random from a probability distribution. Since common…
Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…
Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the…
Cake cutting is a classic fair division problem, with the cake serving as a metaphor for a heterogeneous divisible resource. Recently, it was shown that for any number of players with arbitrary preferences over a cake, it is possible to…
Divided into three parts, the first marks out enormous geometric issues with the notion of quasi-freenss of an algebra and seeks to replace this notion of formal smoothness with an approximation by means of a minimal unital commutative…