Related papers: A streamlined difference ring theory: Indefinite n…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
We introduce a new framework called linear algebraic number theory (LANT) that reformulates the number-theoretic problem as a regression model and solves it using matrix algebra. This framework restricts all computations to log space,…
The main goal of the paper is the discussion of a deeper interaction between matrix theory over polynomial rings over a field and typical methods of commutative algebra and related algebraic geometry. This is intended in the sense of…
An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…
We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…
We give a combinatorial model for r-spin surfaces with parametrised boundary based on Novak (2015). The r-spin structure is encoded in terms of $\mathbb{Z}_r$-valued indices assigned to the edges of a polygonal decomposition. This…
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this paper is a contribution to building a general purpose DR…
Since the alternating sign matrix conjecture, proposed by Mills, Robbins, and Rumsey in 1982, was proved by Zeilberger and Kuperberg, several refined enumerations have been considered. In particular, Behrend et al. obtained a quadruply…
Achieving disentangled representations of information is one of the key goals of deep network based machine learning system. Recently there are more discussions on this issue. In this paper, by comparing the geometric structure of…
We determine the Waring rank of the fundamental skew invariant of any complex reflection group whose highest degree is a regular number. This includes all irreducible real reflection groups.
The chapter presents mathematical models intended for creating a topological drawing of a non-separable non-planar graph based on the methods of G. Ringel's vertex rotation theory. The induced system of cycles generates a topological…
The notion of a derived A-infinity algebra, considered by Sagave, is a generalization of the classical notion of A-infinity algebra, relevant to the case where one works over a commutative ring rather than a field. We initiate a study of…
We extend Petkov\v{s}ek's algorithm for computing hypergeometric solutions of scalar difference equations to the case of difference systems $\tau(Y) = M Y$, with $M \in {\rm GL}_n(C(x))$, where $\tau$ is the shift operator. Hypergeometric…
This paper introduces and studies a new model of computation called an Alternating Automatic Register Machine (AARM). An AARM possesses the basic features of a conventional register machine and an alternating Turing machine, but can carry…
We introduce a broad class of random graph models: the generalised hypergeometric ensemble (GHypEG). This class enables to solve some long standing problems in random graph theory. First, GHypEG provides an elegant and compact formulation…
The fundamental representations of the special linear group ${\rm SL}_n$ over the complex numbers are the exterior powers of $\mathbb{C}^n$. We consider the invariant rings of sums of arbitrary many copies of these ${\rm SL}_n$-modules. The…
Problems with localized nonhomogeneous material properties present well-known challenges for numerical simulations. In particular, such problems may feature large differences in length scales, causing difficulties with meshing and…
We consider how the problem of determining normal forms for a specific class of nonholonomic systems leads to various interesting and concrete bridges between two apparently unrelated themes. Various ideas that traditionally pertain to the…
Alternating minimization heuristics seek to solve a (difficult) global optimization task through iteratively solving a sequence of (much easier) local optimization tasks on different parts (or blocks) of the input parameters. While popular…
Mathematically representing the shape of an object is a key ingredient for solving inverse rendering problems. Explicit representations like meshes are efficient to render in a differentiable fashion but have difficulties handling topology…