An Invitation to Higher Arity Science

Carlos Zapata-Carratala; Xerxes D. Arsiwalla

Home/Archive/arXiv

arXiv · 2201.09738

An Invitation to Higher Arity Science

Carlos Zapata-Carratala·Xerxes D. Arsiwalla

View original source ↗Read source document ↗Export metadata ↓

Abstract

Analytical thinking is dominated by binary ideas. From pair-wise interactions, to algebraic operations, to compositions of processes, to network models, binary structures are deeply ingrained in the fabric of most current scientific paradigms. In this article we introduce arity as the generic conceptualization of the order of an interaction between a discrete collection of entities and argue that there is a rich universe of higher arity ideas beyond binarity waiting to be explored. To illustrate this we discuss several higher order phenomena appearing in a wide range of research areas, paying special attention to instances of ternary interactions. From the point of view of formal sciences and mathematics, higher arity thinking opens up new paradigms of algebra, symbolic calculus and logic. In particular, we delve into the special case of ternary structures, as that itself reveals ample surprises: new notions of associativity (or lack thereof) in ternary operations of cubic matrices, ternary isomorphisms and ternary relations, the integration problem of 3-Lie algebras, and generalizations of adjacency in 3-uniform hypergraphs. All these are open problems that strongly suggest the need to develop new ternary mathematics. Finally, we comment on potential future research directions and remark on the transdisciplinary nature of higher arity science.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Carlos Zapata-Carratala, Xerxes D. Arsiwalla. 2022-01-21. An Invitation to Higher Arity Science. https://arxiv.org/abs/2201.09738

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On Some Applications to the Newton--Raphson Method

Newton's method is classically viewed as an iterative procedure for approximating a zero of a nonlinear function. In this paper, we consider the Newton iterates from a quadrature perspective: the iterates generate a partition of the interval between the initial point and the root, which in turn induces a composite trapezoidal rule. We establish an exact decomposition of the integral associated with this Newton-generated quadrature and characterize the resulting quadrature error. We also obtain an explicit bound for this error in terms of the initial Newton decrement and give a condition under which it is smaller than the error of the trapezoidal rule on the original interval. These results provide a connection between Newton's method and the quadrature rule induced by its iterates.

math.GM↗

arXiv2026

Telstar Balls Gone Wild

We describe an artistic project involving the fabrication of each of the 1812 distinct footballs that can be obtained by rearranging the way the 32 panels of a classic Telstar ball are stitched together. Each ball is one of a kind and individually numbered, and the entire series is sorted by decreasing roundness.

math.GM↗

arXiv2026

On the polynomial values represented by binary quadratic forms

Many Diophantine equations can be reduced to the question of whether, for a given non-degenerate integral binary quadratic form $F$ and a univariate polynomial $P$ with integer coefficients, $P(x)$ can be represented by $F$ for infinitely many values of $x$. We develop a method for answering this question for certain cubic and quartic polynomials $P$, as well as for certain polynomials of the form $P(x)=R(Q(x))$, where $R(t)$ and $Q(x)$ are polynomials of degrees $3$ and $2$, respectively. Applying this method with $F(y,z)=y^2+z^2$, $R(t)=t^3-4$ and $Q(x)=x^2$, we conclude that $x^6-4$ is a sum of two squares infinitely often. In turn, this implies that the equation $y^2+x^3y+z^2+1=0$ has infinitely many integer solutions. Prior to this work, it was the shortest equation for which it was unknown whether its integer solution set is finite or infinite. We conclude with a list of the new shortest equations for which the finiteness problem remains open. All main results of this paper have been formalized in Lean using Aristotle.

math.GM↗