Related papers: The algebra of balanced dessins
We generalise recent results about quasi-Cartan, Cartan and diagonal subalgebras by introducing graded versions. We show that there is a correspondence between graded algebraic quasi-Cartan/ Cartan/ diagonal pairs and certain graded twisted…
In this article, we briefly describe various tools and approaches that algebraic geometry has to offer to straighten bent objects. Throughout this article we will consider a specific example of a bent or curved piece of paper which in our…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
Motivated by performance optimization of large-scale graph processing systems that distribute the graph across multiple machines, we consider the balanced graph partitioning problem. Compared to the previous work, we study the…
We extend the definition of algebraic entropy to semi-discrete (difference-differential) equations. Calculating the entropy for a number of integrable and non integrable systems, we show that its vanishing is a characteristic feature of…
This is a report on recent progress concerning the interactions between derived algebraic geometry and deformation quantization. We present the notion of derived algebraic stacks, of shifted symplectic and Poisson structures, as well as the…
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
With distributed computing and mobile applications becoming ever more prevalent, synchronizing diverging replicas of the same data is a common problem. Reconciliation -- bringing two replicas of the same data structure as close as possible…
A nested coordinate system is a reassigning of independent variables to take advantage of geometric or symmetry properties of a particular application. Polar, cylindrical and spherical coordinate systems are primary examples of such a…
We study graded symmetric algebras, which are the symmetric monoids in the monoidal category of vector spaces graded by a group. We show that a finite dimensional graded semisimple algebra is graded symmetric. The center of a symmetric…
Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…
We present here a product between vectors and scalars that {\it mixes} them within their own space, using imaginaries to describe geometric products between vectors as complex vectors, rather than introducing higher order/dimensional vector…
For a field $F$ and an integer $d\geq 1$, we consider the universal associative $F$-algebra $A$ generated by two sets of $d+1$ mutually orthogonal idempotents. We display four bases for the $F$-vector space $A$ that we find attractive. We…
A paradigm for a global algebraic number theory of the reals is formulated with the purpose of providing a unified setting for algebraic and transcendental number theory. This is achieved through the study of subgroups of nonstandard models…
Symmetry can be used to help solve many problems. For instance, Einstein's famous 1905 paper ("On the Electrodynamics of Moving Bodies") uses symmetry to help derive the laws of special relativity. In artificial intelligence, symmetry has…
Higher degree forms are homogeneous polynomials of degree $d > 2,$ or equivalently symmetric $d$-linear spaces. This paper is mainly concerned about the algebraic structure of the centers of higher degree forms with applications…
We introduce the notion of balance for directed graphs: a weighted directed graph is $\alpha$-balanced if for every cut $S \subseteq V$, the total weight of edges going from $S$ to $V\setminus S$ is within factor $\alpha$ of the total…
Influence diagrams provide a compact graphical representation of decision problems. Several algorithms for the quick computation of their associated expected utilities are available in the literature. However, often they rely on a full…