English
Related papers

Related papers: Grationality, With a Spoon

200 papers

In the early part of the paper, various geometrical formulas are derived. Then, at some point in the paper, the concept of a Pythagorean rational is introduced. A Pythagorean rational is a rational number which is the ratio of two integers…

General Mathematics · Mathematics 2008-07-08 Konstantine Zelator

This article illustrates pedagogy through training in the handling of abstractions. Mental arithmetic is not limited to numerical calculation; one can mentally calculate primitives and simplify analytical expressions. Even if there is…

History and Overview · Mathematics 2025-04-09 Nicolas Bouleau

The purpose of this paper is twofold: 1. we prove the triangulability of smooth orbifolds with corners, generalizing the same statement for orbifolds. 2. based on 1, we propose a new homology theory. We call it geometric homology theory…

Algebraic Topology · Mathematics 2023-05-30 Hao Yu

A physical applicability of normed split-algebras, such as hyperbolic numbers, split-quaternions and split-octonions is considered. We argue that the observable geometry can be described by the algebra of split-octonions. In such a picture…

High Energy Physics - Theory · Physics 2007-05-23 Merab Gogberashvili

A positive integer $n$ is called a $\theta$-congruent number if there is a triangle with sides $a,b$ and $c$ for which the angle between $a$ and $b$ is equal to $\theta$ and its area is $n\sqrt{r^2 - s^2}$, where $0 < \theta < \pi$, $\cos…

Number Theory · Mathematics 2023-08-29 Jerome T. Dimabayao , Soma Purkait

A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information…

Analysis of PDEs · Mathematics 2018-06-12 Andrea Braides , Paolo Cermelli , Simone Dovetta

The paper considers fair allocation of indivisible nondisposable items that generate disutility (chores). We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected subgraph of this…

Artificial Intelligence · Computer Science 2018-12-06 Sylvain Bouveret , Katarína Cechlárová , Julien Lesca

Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph $G$ with $e$ edges, is to label the vertices of $G$ with $0, 1, \cdots, e$ such that, if we specify to each edge the difference…

Quantum Physics · Physics 2017-08-02 Sayed Mohammad Hosseini , Mahdi Davoudi Darareh , Shahrooz Janbaz , Ali Zaghian

We consider the problem of partitioning an undirected graph (representing a social network) over $n$ nodes and max degree $\Delta$ into $k$ equally sized parts. Each node in the graph, representing an agent, derives utility proportional to…

Computer Science and Game Theory · Computer Science 2026-05-06 Vignesh Viswanathan

We consider the problem of fairly dividing a set of items. Much of the fair division literature assumes that the items are `goods' i.e., they yield positive utility for the agents. There is also some work where the items are `chores' that…

Computer Science and Game Theory · Computer Science 2021-03-18 Haris Aziz , Ioannis Caragiannis , Ayumi Igarashi , Toby Walsh

We study the allocation of indivisible goods among groups of agents using well-known fairness notions such as envy-freeness and proportionality. While these notions cannot always be satisfied, we provide several bounds on the optimal…

Computer Science and Game Theory · Computer Science 2022-08-24 Pasin Manurangsi , Warut Suksompong

We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…

Combinatorics · Mathematics 2024-08-20 David Jensen , Doel Rivera Laboy

This research explores the sum of divisors - $\sigma(n)$ - and the abundancy index given by the function $\frac{\sigma(n)}{n}$. We give a generalization of amicable pairs - feebly amicable pairs (also known as harmonious pairs), that is…

Number Theory · Mathematics 2022-08-16 Jamie Bishop , Abigail Bozarth , Rebekah Kuss , Benjamin Peet

One often sees a sharp distinction in mathematics between descriptions from the outside and from the inside. Think of defining a set in the plane through an algebraic equation, or dynamically as the closure of the orbit of some point under…

Logic · Mathematics 2016-09-06 Alessandra Carbone , S. Semmes

The classic cake-cutting problem provides a model for addressing fair and efficient allocation of a divisible, heterogeneous resource (metaphorically, the cake) among agents with distinct preferences. Focusing on a standard formulation of…

Computer Science and Game Theory · Computer Science 2021-05-21 Eshwar Ram Arunachaleswaran , Siddharth Barman , Rachitesh Kumar , Nidhi Rathi

We define an $n$-gon to be any convex polygon with $n$ vertices. Let $V$ represent the set of vertices of the polygon. A proper $k$-coloring refers to a function, $f$ : $V$ $\rightarrow$ $\{1, 2, 3, ... k\}$, such that for any two vertices…

Discrete Mathematics · Computer Science 2013-12-17 Shantanu Chhabra

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

Combinatorics · Mathematics 2014-07-22 Amritanshu Prasad

In this paper, we propose a novel fairness framework grounded in the concept of happiness, a measure of the utility each group gains fromdecisionoutcomes. Bycapturingfairness through this intuitive lens, we not only offer a more…

Machine Learning · Computer Science 2025-11-04 Georg Pichler , Marco Romanelli , Pablo Piantanida

We revisit the geometric foundations of mesh representation through the lens of Plane-based Geometric Algebra (PGA), questioning its efficiency and expressiveness for discrete geometry. We find how $k$-simplices (vertices, edges, faces,…

Computational Geometry · Computer Science 2025-11-17 Steven De Keninck , Martin Roelfs , Leo Dorst , David Eelbode

In many everyday categories (sets, spaces, modules, ...) objects can be both added and multiplied. The arithmetic of such objects is a challenge because there is usually no subtraction. We prove a family of cases of the following principle:…

Category Theory · Mathematics 2010-02-04 Marcelo Fiore , Tom Leinster