Related papers: Variants of Schroeder Dissections
We consider a symbolic coding of linear trajectories in the regular octagon with opposite sides identified (and more generally in regular 2n-gons). Each infinite trajectory gives a cutting sequence corresponding to the sequence of sides…
This revisit gives a survey on the analytical methods for the inverse exponential Radon transform which has been investigated in the past three decades from both mathematical interests and medical applications such as nuclear medicine…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
In this paper, we systematically study non-crossing chords of simple polygons in the plane. We first introduce the reduced Euler characteristic of a family of line-segments, and subsequently investigate the structure of the diagonals and…
The Catalan numbers $C_k$ were first studied by Euler, in the context of enumerating triangulations of polygons $P_{k+2}$. Among the many generalizations of this sequence, the Fuss-Catalan numbers $C^{(d)}_k$ count enumerations of…
A five-dimensional symmetry algebra consisting of Lie point symmetries is firstly computed for the nonlinear Schroedinger equation, which, together with a reflection invariance, generates two five-parameter solution groups. Three ansaetze…
A generalized connection, including Christoffel coefficients, torsion, non-metricity tensor and metric-asymmetricity object, is analyzed according to the Schouten classification. The inverse structure matrix is found in the linearized…
The regular 2n-gon (square, hexagon, octagon, ...) is subdivided into smaller polygons (tiles) by the subset of diagonals which run parallel to any of the 2n sides. The manuscript reports on the number of tiles up to the 78-gon.
Convex or concave sequences of $n$ positive terms, viewed as vectors in $n$-space, constitute convex cones with $2n-2$ and $n$ extreme rays, respectively. Explicit description is given of vectors spanning these extreme rays, as well as of…
The review is based on the author's papers since 1985 in which a new approach to the separation of variables (\SoV) has being developed. It is argued that \SoV, understood generally enough, could be the most universal tool to solve…
We find three characterizations for a multidimensional (n+1)-web W possessing a reduct reducible subweb: its closed form equations, the integrability of an invariant distribution associated with W, and the relations between the components…
The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a…
In this note, given a regular Courant algebroid, we compute its group of automorphisms relative to a dissection. We also propose an infinitesimal version and recover examples of the literature.
In the first part of the paper, we give an explicit algorithm to compute the (genus zero) Gromov-Witten invariants of blow-ups of an arbitrary convex projective variety in some points if one knows the Gromov-Witten invariants of the…
This pedagogical document explains three variational representations that are useful when comparing the efficiencies of reversible Markov chains: (i) the Dirichlet form and the associated variational representations of the spectral gaps;…
We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…
We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…
We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…