Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1801.07467

On defectivity of families of full-dimensional point configurations

Christopher Borger·Benjamin Nill
View original source ↗Read source document ↗Export metadata ↓

Abstract

The mixed discriminant of a family of point configurations can be considered as a generalization of the $A$-discriminant of one Laurent polynomial to a family of Laurent polynomials. Generalizing the concept of defectivity, a family of point configurations is called defective if the mixed discriminant is trivial. Using a recent criterion by Furukawa and Ito we give a necessary condition for defectivity of a family in the case that all point configurations are full-dimensional. This implies the conjecture by Cattani, Cueto, Dickenstein, Di Rocco and Sturmfels that a family of $n$ full-dimensional configurations in $\mathbb{Z}^n$ is defective if and only if the mixed volume of the convex hulls of its elements is $1$.

Explore related subjects

math.COmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christopher Borger, Benjamin Nill. 2020-05-21. On defectivity of families of full-dimensional point configurations. https://arxiv.org/abs/1801.07467

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗