Related papers: Planar coincidences for N-fold symmetry
The groups of similarity and coincidence rotations of an arbitrary lattice L in d-dimensional Euclidean space are considered. It is shown that the group of similarity rotations contains the coincidence rotations as a normal subgroup.…
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
We study Mirror Symmetry of log Calabi-Yau surfaces. On one hand, we consider the number of ``affine lines'' of each degree in the complement of a smooth cubic in the projective plane. On the other hand, we consider coefficients of a…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…
We analyze general structure of N-fold supersymmetry which provides a systematic framework to construct weakly quasi-solvable quantum mechanical systems. Main ingredients of our analysis are dimensional analysis and introduction of an…
Let $f(n)$ denote the number of 1-shell totally symmetric plane partitions of weight $n$. Recently, Hirschhorn and Sellers, Yao, and Xia established a number of congruences modulo 2 and 5, 4 and 8, and 25 for $f(n)$, respectively. In this…
In this paper we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal…
The question of Lorentz invariance for finite N approximations of relativistic membranes is addressed. We find that one of the classical manifestations of Lorentz-invariance is not possible for NxN matrices (at least when N=2 or 3). How the…
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…
Harmonic frames of prime order are investigated. The primary focus is the enumeration of inequivalent harmonic frames, with the exact number given by a recursive formula. The key to this result is a one-to-one correspondence developed…
The problem of counting polymer coverings on the rectangular lattices is investigated. In this model, a linear rigid polymer covers $k$ adjacent lattice sites such that no two polymers occupy a common site. Those unoccupied lattice sites…
We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…
We conjecture that the $O(N)$-symmetric non-linear sigma model in the semi-infinite $(1+1)$-dimensional space is ``integrable'' with respect to the ``free'' and the ``fixed'' boundary conditions. We then derive, for both cases, the boundary…
We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…
An interesting problem in classical differential geometry is to find methods to prove that two surfaces defined by different charts actually coincide up to position in space. In a previous paper we proposed a method in this direction for…
The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
We examine the reductions of the order of certain third- and second-order nonlinear equations with arbitrary nonlinearity through their symmetries and some appropriate transformations. We use the folding transformation which enables one to…