Related papers: Latin trades and simplicial complexes
In a latin square of order $n$, a near transversal is a collection of $n-1$ cells which intersects each row, column, and symbol class at most once. A longstanding conjecture of Brualdi, Ryser, and Stein asserts that every latin square…
In this paper, we define and prove basic properties of complement polyhedral product spaces, dual complexes and polyhedral join complexes. Then we compute the universal algebra of polyhedral join complexes under certain split conditions and…
Using the topological technique of diagrams of spaces, we calculate the homology of the union and the complement of finite arrangements of subspaces of the form $D + SP^{n-d}(X)$ in symmetric products $SP^n(X)$ where $D\in SP^d(X)$. As an…
We discuss the problem of existence of latin squares without a substructure consisting of six elements $(r_1,c_2,l_3)$, $(r_2,c_3,l_1)$, $(r_3,c_1,l_2)$, $(r_2,c_1,l_3)$, $(r_3,c_2,l_1)$, $(r_1,c_3,l_2)$. Equivalently, the corresponding…
We present a simple criterion for solvability of lattice spin systems on the basis of the graph theory and the simplicial homology. The lattice systems satisfy algebras with graphical representations. It is shown that the null spaces of…
We compute the equivariant cohomology of smooth Calogero-Moser spaces and some associated symplectic resolutions of symplectic quotient singularities.
Let $P$ be a partial latin square of prime order $p>7$ consisting of three cyclically generated transversals. Specifically, let $P$ be a partial latin square of the form: \[ P=\{(i,c+i,s+i),(i,c'+i,s'+i),(i,c''+i,s''+i)\mid 0 \leq i< p\} \]…
In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…
This paper offers an algorithmic solution to the problem of obtaining "economical" formulae for some maps in Simplicial Topology, having, in principle, a high computational cost in their evaluation. In particular, maps of this kind are used…
In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of…
We prove that, for all even $n\geq10$, there exists a latin square of order $n$ with at least one transversal, yet all transversals coincide on $ \big\lfloor n/6 \big\rfloor$ entries. These latin squares have at least $ 19 n^2/36 + O(n)$…
We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a…
We summarize recent results initiating spectral analysis on pseudo-Riemannian locally symmetric spaces $\Gamma \backslash G/H$, beyond the classical setting where $H$ is compact (e.g. theory of automorphic forms for arithmetic $\Gamma$) or…
The SageManifolds project aims at extending the mathematics software system Sage towards differential geometry and tensor calculus. Like Sage, SageManifolds is free, open-source and is based on the Python programming language. We discuss…
The main goal of this paper is a calculation of the integral (co)homology of the group of symmetric automorphisms of a free product. We proceed by giving a geometric interpretation of symmetric automorphisms via a moduli space of certain…
We study prismatics sets analogously to simplical sets except that realization involves prisms, i.e., products of simplices rather than just simplices. Particular examples are the prismatic subdivision of a simplicial set S and the…
In this paper we develop a combinatorial abstraction of tropical linear programming. This generalizes the search for a feasible point of a system of min-plus-inequalities. It is based on the polyhedral properties of triangulations of the…
This article, showing that almost all objects in the title are asymmetric, is re-typed from a manuscript I wrote somewhere around 1980 (after the papers of Bang and Friedland on the permanent conjecture but before those of Egorychev and…
A Latin array is a matrix of symbols in which no symbol occurs more than once within a row or within a column. A diagonal of an $n\times n$ array is a selection of $n$ cells taken from different rows and columns of the array. The weight of…
We construct a canonical extension for strong proximity lattices in order to give an algebraic, point-free description of a finitary duality for stably compact spaces. In this setting not only morphisms, but also objects may have distinct…