Related papers: Representation and coding of rational pairs on a T…

The correspondence between right triangles with rational sides, triplets of rational squares in arithmetic succession and integral solutions of certain quadratic forms is well known. We show how this correspondence can be extended to the…

This paper introduces Farey Recursive Functions and investigates their basic properties. Farey Recursive Functions are a special type of recursive function from the rationals to a commutative ring. The recursion of these functions is…

Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…

In this work, we propose trait-based merge trees a generalization of merge trees to feature level sets, targeting the analysis of tensor field or general multi-variate data. For this, we employ the notion of traits defined in attribute…

For every linear binary code $C$, we construct a geometric triangular configuration $\Delta$ so that the weight enumerator of $C$ is obtained by a simple formula from the weight enumerator of the cycle space of $\Delta$. The triangular…

We study the problem of approximating all-pair distances in a weighted undirected graph with differential privacy, introduced by Sealfon [Sea16]. Given a publicly known undirected graph, we treat the weights of edges as sensitive…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

Tree structures have been shown to provide an efficient framework for propagating beliefs [Pearl,1986]. This paper studies the problem of finding an optimal approximating tree. The star decomposition scheme for sets of three binary…

A tree diagram is a tree with positive integral weight on each edge, which is a notion generalized from the Dynkin diagrams of finite-dimensional simple Lie algebras. We introduce two nilpotent Lie algebras and their extended solvable Lie…

Treewidth is a well-studied decompositional parameter to measure the tree-likeness of a graph. While the propositional satisfiability problem (SAT) is known to be tractable when parameterized by the treewidth of the underlying primal graph,…

Let X -> Y be a fibration whose fibers are complete intersections of two quadrics. We develop new categorical and algebraic tools---a theory of relative homological projective duality and the Morita invariance of the even Clifford algebra…

In this paper, we consider a set of similar triangles with parallel sides, along with a set of points in the plane. It turns out that the set $\mathbb{R}_2= \{\pm <x >=\pm (x^2,x,1); x\in\mathbb{R} \}$ describes this set of triangles quite…

Given any number field, we prove that there exist arbitrarily shaped constellations consisting of pairwise non-associate prime elements of the ring of integers. This result extends the celebrated Green-Tao theorem on arithmetic progressions…

In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on…

We present four novel approximation algorithms for finding triangulation of minimum treewidth. Two of the algorithms improve on the running times of algorithms by Robertson and Seymour, and Becker and Geiger that approximate the optimum by…

In this paper we consider one particular mathematical problem of this large area of fractional powers of self-adjoined elliptic operators, defined either by Dunford-Taylor-like integrals or by the representation through the spectrum of the…

The aim of this work is to prove that the connected parts of Farey complex structure in plane are triangles or quadrangles. To do this work we go back to plane convex polygones with oriented edge for wich we prove that if two consecutive…

Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…

Neural networks with tree-based sentence encoders have shown better results on many downstream tasks. Most of existing tree-based encoders adopt syntactic parsing trees as the explicit structure prior. To study the effectiveness of…

We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…