Related papers: An Identity for Vertically Aligned Entries in Pasc…
This paper provides an introduction to trace diagrams at a level suitable for advanced undergraduates. Trace diagrams are a non-traditional notation for linear algebra. Vectors are represented by edges in a diagram, and matrices by markings…
Three-dimensional $N^{th}$ order nodal Lagrangian tetrahedral finite elements ($P_N$ elements) can be generated using Pascal's tetrahedron $\mathcal{H}$ where each node in 3D element space corresponds to an entry in $\mathcal{H}$. For the…
A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…
We introduce a linear algebraic object called a bidiagonal triad. A bidiagonal triad is a modification of the previously studied and similarly defined concept of bidiagonal triple. A bidiagonal triad and a bidiagonal triple both consist of…
Owing to their versatility, graph structures admit representations of intricate relationships between the separate entities comprising the data. We formalise the notion of connection between two vertex sets in terms of edge and vertex…
We discuss the non autonomous nonlinear partial difference equations belonging to Boll classification of quad graph equations consistent around the cube. We show how starting from the compatible equations on a cell we can construct the…
We address the problem of defining graph transformations by the simultaneous application of direct transformations even when these cannot be applied independently of each other. An algebraic approach is adopted, with production rules of the…
In planar algebras, we show how to project certain simple "quadratic" tangles onto the linear space spanned by "linear" and "constant" tangles. We obtain some corollaries about the principal graphs and annular structure of subfactors.
We introduce a linear algebraic object called a bidiagonal triple. A bidiagonal triple consists of three diagonalizable linear transformations on a finite-dimensional vector space, each of which acts in a bidiagonal fashion on the…
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
In 1640's, Blaise Pascal discovered a remarkable property of a hexagon inscribed in a conic - Pascal Theorem, which gave birth of the projective geometry. In this paper, a new geometric invariant of algebraic curves is discovered by a…
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two…
We consider two families of Pascal-like triangles that have all ones on the left side and ones separated by $m-1$ zeros on the right side. The $m=1$ cases are Pascal's triangle and the two families also coincide when $m=2$. Members of the…
We show that the $n$'th diagonal sum of Barry's modified Pascal triangle can be described as the continuant of the run lengths of the binary representation of $n$. We also obtain an explicit description for the row sums.
A vertical recursive relation approach to Riordan arrays is induced, while the horizontal recursive relation is represented by $A$- and $Z$-sequences. This vertical recursive approach gives a way to represent the entries of a Riordan array…
In this article we introduce a new type of Pascal pyramids. A regular squared mosaic in the hyperbolic plane yields a $(h^2r)$-cube mosaic in space $\mathbf{H}^2\!\times\!\mathbf{R}$ and the definition of the pyramid is based on this…
The central curve of a linear program is an algebraic curve specified by linear and quadratic constraints arising from complementary slackness. It is the union of the various central paths for minimizing or maximizing the cost function over…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
We consider Clifford algebras with nonsymmetric bilinear forms, which are isomorphic to the standard symmetric ones, but not equal. Observing, that the content of physical theories is dependent on the injection $\oplus^n\bigwedge…
We classify proper holomorphic mappings between generalized pseudoellipsoids of different dimensions. Those domains are parametrized by the exponents. The relations among them are also obtained. Main tool is the orthogonal decomposition of…