Related papers: Upper triangular matrices and Billiard Arrays
We study partially and totally associative ternary algebras of first and second kind. Assuming the vector space underlying a ternary algebra to be a topological space and a triple product to be continuous mapping we consider the trivial…
Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are…
We provide a complete classification of three-dimensional associative algebras over the real and complex number fields based on a complete elementary proof. We list up all the multiplication tables of the algebras up to isomorphism. We…
In this paper we reduce the problem of counting the number of connected components in the intersection of two opposite open Schubert cells in the variety of real complete flags to a purely combinatorial question of counting the number of…
A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.
A billiard is a dynamical system in which a particle alternates between motion in a straight line and specular reflection from a boundary. For billiards in non-convex areas bounded by segments of confocal quadrics are studied. The topology…
We propose a method for the construction of sets of variable dimension strong non-overlapping matrices basing on any strong non-overlapping set of strings.
We give canonical matrices of bilinear or sesquilinear forms UxV-->C, (V/U)xV-->C, in which V is a vector space over the field C of complex numbers and U is its subspace.
We construct a constrained trivariate extension of the univariate normalized B-basis of the vector space of trigonometric polynomials of arbitrary (finite) order n defined on any compact interval [0,\alpha], where \alpha is a fixed (shape)…
We introduce the iteration theory for periodic billiard trajectories in a compact and convex domain of the Euclidean space, and we apply it to establish a multiplicity result for non-iterated trajectories.
We study pairs and triples consisting of triangular numbers such that the product of any two distinct elements decreased by 1 is a perfect square. For a positive integer $n$, we establish a necessary condition for the $n$-th triangular…
We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…
Each rule $f$ that assigns a vector $f(G)$ to an $(n+1)$-graph $G$ determines a class (or property) of $n$-manifold invariants. An invariant $v=v(M)$ is in this class if, for any triangulated manifold $|G|=M$, one has that $v(M)$ is a…
The principal angles between binary collision subspaces in an $N$-billiard system in $d$-dimensional Euclidean space are computed. These angles are computed for equal masses and arbitrary masses. We then provide a bound on the number of…
We consider classical billiards in plane, connected, but not necessarily bounded domains. The charged billiard ball is immersed in a homogeneous, stationary magnetic field perpendicular to the plane. The part of dynamics which is not…
In a biased weak $(a,b)$ polyform achievement game, the maker and the breaker alternately mark $a,b$ previously unmarked cells on an infinite board, respectively. The maker's goal is to mark a set of cells congruent to a polyform. The…
Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A and B be upper triangular n-by-n matrices that (i) are not similar to direct sums of matrices of smaller…
We derive semiclassical contributions of periodic orbits from a boundary integral equation for three-dimensional billiard systems. We use an iterative method that keeps track of the composition of the stability matrix and the Maslov index…
In some matrix formations, factorizations and transformations, we need special matrices with some properties and we wish that such matrices should be easily and simply generated and of integers. In this paper, we propose a zero-sum rule for…
The infinite upper triangular Pascal matrix is $T = [\binom{j}{i}]$ for $0\leq i,j$. It is easy to see that any leading principle square submatrix is triangular with determinant $1$, hence invertible. In this paper, we investigate the…