相关论文: Computational Geometry Column 36

This article gives a summary of the finite-dimesional irreducible representations of the $q$-Onsager algebra, which are treated in detail in our paper `The augmented tridiagonal algebra'.

This paper deals with some results concerning finitely generated coreduced comultiplication modules over a commutative ring.

We illustrate the use of the computer algebra system Macaulay2 for simplifications of classical unirationality proofs. We explicitly treat the moduli spaces of curves of genus g=10, 12 and 14.

We formulate a mathematical setup for computational neural networks using noncommutative algebras and near-rings, in motivation of quantum automata. We study the moduli space of the corresponding framed quiver representations, and find…

As main result we show that for each g > 1 there is some translation surface of genus g whose Veech group is a non congruence subgroup of SL(2,Z). We use origamis/square-tiled surfaces to produce our examples. The article is divided into…

We discuss well known geometric constructions via paper-folding. The note is written primary for school students.

Let $R$ be a polynomial ring over a field. We describe the extremal rays and the facets of the cone of local cohomology tables of finitely generated graded $R$-modules of dimension at most two. Moreover, we show that any point inside the…

We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…

In this paper, we consider optimization problems w.r.t. to pairs of orthogonal matrices $XY = I$. Problems of this form arise in several applications such as finding shape correspondence in computer graphics. We show that the space of such…

We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…

We show that deciding whether a given set of circles can be packed into a rectangle, an equilateral triangle, or a unit square are NP-hard problems, settling the complexity of these natural packing problems. On the positive side, we show…

We show that an important problem ($k$-ICG) in computational biology is equivalent to a colored version of a well-known graph layout problem ($k$-CVS).

In this paper we study the Grassmannian of submodules of a given dimension inside a finitely generated projective module $P$ for a finite dimensional algebra $\Lambda$ over an algebraically closed field. The orbit of such a submodule $C$…

We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…

Let $X$ be a smooth projective geometrically connected curve over a finite field with function field $K$. Let $\G$ be a connected semisimple group scheme over $X$. Under certain hypothesis we prove the equality of two numbers associated…

A simply colored coalgebra is a coassociative counital coalgebra $C$ over an arbitrary ring $R$, which can be decomposed into a direct sum of two $R$-modules: one generated by set-like elements and another consisting of conilpotent…

We give an overview of recently implemented polymake features for computations in tropical geometry. The main focus is on explicit examples rather than technical explanations. Our computations employ tropical hypersurfaces, moduli of…

The first part of this paper is a survey on Teichmueller curves and Veech groups, with emphasis on the special case of origamis where much stronger tools for the investigation are available than in the general case. In the second part we…

We envision a machine capable of solving mathematical problems. Dividing the quantitative reasoning system into two parts: thought processes and cognitive processes, we provide probabilistic descriptions of the architecture.

In this paper we study resolutions which arise as iterated mapping cones.