相关论文: The Varchenko Determinant of an Oriented Matroid

Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khachiyan1996}, fair allocations\linebreak \cite{anari2016nash},…

Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…

An algorithm to compute the six distances between particles of a planar Four-Body central configuration is presented according to the following schema. An orthocentric tetrahedron is computed as a function of given masses. Each mass is…

Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…

Generalizing work from the 1970s on the determinants of distance hypermatrices of trees, we consider the hyperdeterminants of order-$k$ Steiner distance hypermatrices of trees on $n$ vertices. We show that they can be nearly diagonalized as…

We give a cohomological interpretation of the Heaviside filtration on the Varchenko--Gelfand ring of a pair $(\mathcal{A},\mathcal{K})$, where $\mathcal{A}$ is a real hyperplane arrangement and $\mathcal{K}$ is a convex open subset of the…

Oriented matroids can serve as a tool of modeling of collective decision-making processes in contradictory problems of pattern recognition. We present a generalization of the committee techniques of pattern recognition to oriented matroids.…

Motivated by information geometry, a distance function on the space of stochastic matrices is advocated. Starting with sequences of Markov chains the Bhattacharyya angle is advocated as the natural tool for comparing both short and long…

We develop certain combinatorial tools for the study of discriminants of general systems of polynomial equations. Applying these tools in a sequel paper, we completely classify components of such discriminants, generalizing the classical…

For a given Markov chain Monte Carlo algorithm we introduce a distance between two configurations that quantifies the difficulty of transition from one configuration to the other configuration. We argue that the distance takes a universal…

Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…

The Wro\'nski determinant ({\em Wro\'nskian}), usually introduced in standard courses in Ordinary Differential Equations (ODE), is a very useful tool in algebraic geometry to detect ramification loci of linear systems. The present survey…

The concept of matrix rigidity was introduced by Valiant(independently by Grigoriev) in the context of computing linear transformations. A matrix is rigid if it is far(in terms of Hamming distance) from any matrix of low rank. Although we…

We show that the 4-variable generating function of certain orientation related parameters of an ordered oriented matroid is the evaluation at (x + u, y+v) of its Tutte polynomial. This evaluation contains as special cases the counting of…

A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The realization space of an oriented (resp., phased) matroid is the…

We propose a definition of an "oriented interval greedoid" that simultaneously generalizes the notion of an oriented matroid and the construction on antimatroids introduced by L. J. Billera, S. K. Hsiao, and J. S. Provan in "Enumeration in…

Let A be an n by d matrix having full rank n. An orthogonal dual A^{\perp} of A is a (d-n) by d matrix of rank (d-n) such that every row of A^{\perp} is orthogonal (under the usual dot product) to every row of A. We define the orthogonal…

We introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial $P(X)$ on a set of variables $X=\{x_1,\ldots,x_n\}$ and a linear matroid $M=(X,\mathcal{I})$ of rank $k$,…

In 1993, Csima and Sawyer proved that in a non-pencil arrangement of n pseudolines, there are at least $\frac{6}{13}n$ simple points of intersection. Since pseudoline arrangements are the topological representations of reorientation classes…

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…