Related papers: 4D Dyck triangle and its projections
The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…
We construct the smooth, compact moduli space of similarity classes of labeled, oriented triangles. The space, denoted $\mathfrak D$, is a connected sum of three projective planes, and projects via blowdown to two shape spaces that have…
The main purpose of this note is to provide an elementary discussion of some simple triangles of integer numbers in particular through their connections with representation theory of $sl_2$. The triangles under consideration are the Catalan…
We propose a discretization of classical confocal coordinates. It is based on a novel characterization thereof as factorizable orthogonal coordinate systems. Our geometric discretization leads to factorizable discrete nets with a novel…
We present the new combinatorial class of product-coproduct prographs which are planar assemblies of two types of operators: products having two inputs and a single output and coproducts having a single input and two outputs. We show that…
A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the…
In the Directed Disjoint Paths problem, we are given a digraph $D$ and a set of requests $\{(s_1, t_1), \ldots, (s_k, t_k)\}$, and the task is to find a collection of pairwise vertex-disjoint paths $\{P_1, \ldots, P_k\}$ such that each…
Two distinct systems of commutative complex numbers in 6 dimensions of the polar and planar types of the form u=x_0+h_1x_1+h_2x_2+h_3x_3+h_4x_4+h_5x_5 are described in this work, where the variables x_0, x_1, x_2, x_3, x_4, x_5 are real…
We consider upward-planar layered drawings of directed graphs, i.e., crossing-free drawings in which each edge is drawn as a y-monotone curve going upward from its tail to its head, and the y-coordinates of the vertices are integers. The…
In this paper we develop a new geometric method to answer the log-concavity questions related to a nice class of combinatorial sequences arising from the Pascal triangle.
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices. We prove the Conjecture for…
The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…
For a finite set $U$ of directions in the Euclidean plane, a convex non-degenerate polygon $P$ is called a $U$-polygon if every line parallel to a direction of $U$ that meets a vertex of $P$ also meets another vertex of $P$. We characterize…
We solve the following geometric problem, which arises in several three-dimensional applications in computational geometry: For which arrangements of two lines and two spheres in R^3 are there infinitely many lines simultaneously…
Dynamical systems, whether continuous or discrete, are used by physicists in order to study non-linear phenomena. In the case of discrete dynamical systems, one of the most used is the quadratic map depending on a parameter. However, some…
Catalan numbers $C(n)=\frac{1}{n+1}{2n\choose n}$ enumerate binary trees and Dyck paths. The distribution of paths with respect to their number $k$ of factors is given by ballot numbers $B(n,k)=\frac{n-k}{n+k}{n+k\choose n}$. These integers…
Let N_d be the number of degree d, nodal, rational plane curves through 3d-1 points in the complex projective plane. The number of degree d>=3, nodal, elliptic plane curves with a fixed (general) j-invariant through 3d-1 points is found to…
We first observe that the relations of the canonical generating isometries of the Cuntz algebra ${\cal O}_N$ are naturally related to the $N$-colored Catalan numbers. For a directed graph $G$, we generalize the Catalan numbers by using the…
Icosahedron and dodecahedron can be dissected into tetrahedral tiles projected from 3D-facets of the Delone polytopes representing the deep and shallow holes of the root lattice D_6. The six fundamental tiles of tetrahedra of edge lengths 1…
A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…