Related papers: The Pattern Complexity of the Sierpi\'{n}ski Trian…
This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…
Tridiagonal matrices with constant main diagonal and reciprocal pairs of off-diagonal entries are considered. Conditions for such matrices with sizes up to 6-by-6 to have elliptical numerical ranges are obtained.
Let $S_i$, $i\in I$, be a countable collection of Jordan curves in the extended complex plane $\Sph$ that bound pairwise disjoint closed Jordan regions. If the Jordan curves are uniform quasicircles and are uniformly relatively separated,…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We determine the symmetrized topological complexity of the circle, using primarily just general topology.
Using methods of conformal field theory, we conjecture an exact form for the probability that n distinct clusters span a large rectangle or open cylinder of aspect ratio k, in the limit when k is large.
We use an alternative definition of topological complexity to show that the topological complexity of the mapping telescope of a sequence $X_1\rightarrow X_2\rightarrow X_3\rightarrow...$ is bounded above by $2max{TC(X_i); i=1,2,...}$.
The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…
After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.
We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $ 3 \times 3 $ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities…
We give an elementary proof of the Pieri-type formula in the cohomology of a Grassmannian of maximal isotropic subspaces of an odd orthogonal or symplectic vector space. This proof proceeds by explicitly computing a triple intersection of…
In this paper we describe a procedure to simplify any given triangulation of the 3-sphere using Pachner moves. We obtain an explicit exponential-type bound on the number of Pachner moves needed for this process. This leads to a new…
It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two…
Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the three sides of equilateral triangles. If…
It is not completely unreasonable to expect that a computable function bounding the number of Pachner moves needed to change any triangulation of a given 3-manifold into any other triangulation of the same 3-manifold exists. In this paper…
We take a categorical approach to describe ternary derivations and ternary automorphisms of triangular algebras. New classes of automorphisms and derivations of triangular algebras are also introduced and studied.
We develop the basic and new tools for classifying non-side-to-side tilings of the sphere by congruent triangles. Then we prove that, if the triangle has any irrational angle in degree, such tilings are: a sequence of 1-parameter families…
We study a new formulation for the eikonal equation |grad u| =1 on a bounded subset of R^2. Considering a field P of orthogonal projections onto 1-dimensional subspaces, with divergence bounded in L^2, we prove existence and uniqueness for…
We prove that it is $\#\mathsf{P}$-complete to count the triangulations of a (non-simple) polygon.
The use of complexified quaternions and $i$-complex geometry in formulating the Dirac equation allows us to give interesting geometric interpretations hidden in the conventional matrix-based approach.