Related papers: Chow Rings of Matroids as Permutation Representati…

The operational Chow cohomology classes of a complete toric variety are identified with certain functions, called Minkowski weights, on the corresponding fan. The natural product of Chow cohomology classes makes the Minkowski weights into a…

We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…

We propose an interpretation for the meets and joins in the lattice of experimental propositions of a physical theory, answering a question of Birkhoff and von Neumann in [1]. When the lattice is atomistic, it is isomorphic to the lattice…

Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…

The space of $n \times m$ complex matrices can be regarded as an algebraic variety on which the group ${\bf GL}_n \times {\bf GL}_m$ acts. There is a rich interaction between geometry and representation theory in this example. In an…

Matroids give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented…

Let $\mathfrak{M}_n$ be the multiplicative monoid of $n \times n$ matrices over a finite field. The monoid algebra $\mathbf{C}[\mathfrak{M}_n]$ has been studied for several decades. One of the important early results is Kov\'acs' theorem…

Tropicalisation (with trivial coefficients) is a process that turns a polynomial equation into a combinatorial predicate on subsets of the set of variables. We show that for each minuscule representation of a simple reductive group, there…

Consider a commutative monoid $(M,+,0)$ and a biadditive binary operation $\mu \colon M \times M \to M$. We will show that under some additional general assumptions, the operation $\mu$ is automatically both associative and commutative. The…

We prove Horrocks' theorem for the odd elementary orthogonal group, which gives a decomposition of an orthogonal matrix with entries from a polynomial ring $R[X]$, over a commutative ring $R$ in which 2 is invertible, as a product of an…

Poisson actions of Poisson Lie groups have an interesting and rich geometric structure. We will generalize some of this structure to Dirac actions of Dirac Lie groups. Among other things, we extend a result of Jiang-Hua-Lu, which states…

For a large class of word hyperbolic groups G the cross product C^*-algebra arising from the action of G on its Gromov boundary is shown to satisfy Poincare duality in K-theory. This class strictly contains fundamental groups of compact,…

We introduce the notion of a duality pair and demonstrate how the left half of such a pair is often covering and preenveloping. As an application, we generalize a result by Enochs et al. on Auslander and Bass classes, and we prove that the…

We construct a weak version of the homological first Steenrod square, a natural transformation from the modulo two Chow group to the Chow group modulo two and two-torsion. No assumption is made on the characteristic of the base field. As an…

The first author introduced the circuit-cocircuit reversal system of an oriented matroid, and showed that when the underlying matroid is regular, the cardinalities of such system and its variations are equal to special evaluations of the…

The spontaneous magnetization of a two-dimensional lattice model can be expressed in terms of the partition function $W$ of a system with fixed boundary spins and an extra weight dependent on the value of a particular central spin. For the…

The topological zeta function of a matroid is a rational function as well as a valuative invariant of the matroid, encoding rich combinatorial information. We analyze topological zeta functions of matroids from the vantage point of several…

We consider the bit complexity of computing Chow forms and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single exponential complexity upper bound. Earlier computational…

Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…