Search arXivSearch

arXiv · 1703.10520

On powers of Plücker coordinates and representability of arithmetic matroids

Abstract

The first problem we investigate is the following: given $k\in \mathbb{R}_{\ge 0}$ and a vector $v$ of Plücker coordinates of a point in the real Grassmannian, is the vector obtained by taking the $k$th power of each entry of $v$ again a vector of Plücker coordinates? For $k\neq 1$, this is true if and only if the corresponding matroid is regular. Similar results hold over other fields. We also describe the subvariety of the Grassmannian that consists of all the points that define a regular matroid. The second topic is a related problem for arithmetic matroids. Let $\mathcal{A} = (E, rk, m)$ be an arithmetic matroid and let $k\neq 1 $ be a non-negative integer. We prove that if $\mathcal{A}$ is representable and the underlying matroid is non-regular, then $\mathcal{A}^k := (E, rk, m^k)$ is not representable. This provides a large class of examples of arithmetic matroids that are not representable. On the other hand, if the underlying matroid is regular and an additional condition is satisfied, then $\mathcal{A}^k$ is representable. Bajo-Burdick-Chmutov have recently discovered that arithmetic matroids of type $\mathcal{A}^2$ arise naturally in the study of colourings and flows on CW complexes. In the last section, we prove a family of necessary conditions for representability of arithmetic matroids.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthias Lenz. 2019-09-29. On powers of Plücker coordinates and representability of arithmetic matroids. https://doi.org/10.1016/j.aam.2019.04.008

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO