Related papers: Latin trades and simplicial complexes

We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with…

For any simplicial complex $X$ with a total ordering of its vertices, one can construct a chain complex $\mathbb{L}_\bullet(X)$ generated by necklaces of simplices in $X$, which computes the homology of the free loop space of the geometric…

In this paper we will introduce and give topological properties of a new concept named simplicial distance which is the simplicial analog of the homotopic distance (in the sense of Marcias-Virgos and Mosquera-Lois in their paper [6]).…

We introduce singular homology for non-Archimedean analytic spaces using a cosimplicial perfectoid space as a Galois representation. We define an integration along a cycle, which gives a pairing with the singular homology and the space of…

Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…

We introduce new algebraic structures associated with heptagon relations -- higher analogue of the well-known pentagon. The main points we deal with are: (i) polygon relations as algebraic imitations of Pachner moves, on the example of…

Consider a partial Latin square $P$ where the first two rows and first three columns are completely filled, and every other cell of $P$ is empty. It has been conjectured that all such partial Latin squares of order at least $8$ are…

A \emph{Latin square} is a matrix of symbols such that each symbol occurs exactly once in each row and column. A Latin square $L$ is \emph{row-Hamiltonian} if the permutation induced by each pair of distinct rows of $L$ is a full cycle…

There exists a bijection between the set of Latin squares of order $n$ and the set of feasible solutions of the 3-dimensional planar assignment problem ($3PAP_n$). In this paper, we prove that, given a Latin square isotopism $\Theta$, we…

The fundamental combinatorial structure of a net in CP^2 is its associated set of mutually orthogonal latin squares. We define equivalence classes of sets of orthogonal Latin squares by label equivalences of the lines of the corresponding…

We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…

Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical distributed computing and simplicial neural networks. Graphs are…

This paper provides an in-depth analysis of how computational algebraic geometry can be used to deal with the problem of counting and classifying $r\times s$ partial Latin rectangles based on $n$ symbols of a given size, shape, type or…

This article investigates the homotopy theory of simplicial commutative algebras with a view to homological applications.

The notion of a simplicial set originated in algebraic topology, and has also been utilized extensively in category theory, but until relatively recently was not used outside of those fields. However, with the increasing prominence of…

The partial Latin square extension problem is to fill as many as possible empty cells of a partially filled Latin square. This problem is a useful model for a wide range of applications in diverse domains. This paper presents the first…

In their homonymous article, Sam Payne and Thomas Willwacher construct a combinatorial graph complex to compute the weight 11 part of the compactly supported cohomology of the moduli space of curves $\cM_{g,n}$ and compute explicitly the…

The aim of this paper is to explain the relationship between the (co)homology of the free loop space and the Hochschild homology of its singular cochain algebra. We introduce all the relevant technical tools, namely simplicial and cyclic…

This article proposes an algorithm that constructs a Sullivan minimal model for any simply connected simplicial set with effective homology and thereby allows one to decide algorithmically whether two simply connected spaces represented by…

We consider geometric numerical integration algorithms for differential equations evolving on symmetric spaces. The integrators are constructed from canonical operations on the symmetric space, its Lie triple system (LTS), and the…