To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We study relations between $(n_4)$ incidence configurations and the classical Poncelet Porism. Poncelet’s result concerns two conics and a sequence of points and lines that inscribes one conic and circumscribes the other. Poncelet’s Porism states that whether this sequence closes up after m steps only depends on the conics and not on the initial point of the sequence. In other words: Poncelet polygons are movable.
We transfer this motion into a flexibility statement about a large class of $(n_4)$ configurations, in which four (straight) lines pass through each point and four points lie on each line. An instance of such configurations in real geometry had been given by Branko Grünbaum and John Rigby in their classical 1990 paper where they constructed a real geometric realisation of a well known combinatorial $(21_4)$ configuration (which had been studied by Felix Klein), now commonly called the Grünbaum–Rigby configuration.
Since then, there has been an intensive search for movable $(n_4)$ configurations, but it is very surprising that the Grünbaum–Rigby $(21_4)$ configuration admits nontrivial motions. It is well-known that the Grünbaum–Rigby configuration is the smallest example of an infinite class of $(n_4)$ configurations, the trivial celestial configurations. A major result of this paper is that all trivial celestial configurations are movable via Poncelet’s Porism and results about properties of Poncelet grids. Alternative approaches via geometry of billiards, in-circle nets, and pentagram maps that relate the subject to discrete integrable systems are given as well.
We introduce and study different compactifications of the moduli space of n distinct weighted labeled points in a flag of affine spaces. We construct these spaces via the weighted and generalized Fulton-MacPherson compactifications of Routis and Kim-Sato. For certain weights, our compactifications are toric and isomorphic to the polypermutohedral and polystellahedral varieties, which arise in the work of Crowley-Huh-Larson-Simpson-Wang and Eur-Larson on polymatroids, a generalization of matroids. Moreover, we show that these toric compactifications have a fibration structure, with fibers isomorphic to the Losev-Manin space, and are related to each other via a geometric quotient.
We provide a natural definition of an elliptic arrangement, extending the classical framework to an elliptic curve $\mathcal {E}$ with complex multiplication. We analyze the intersections of elements of the arrangement and their connected components as $\operatorname {End}(\mathcal {E})$-modules. Furthermore, we prove that the combinatorial data of elliptic arrangements define both an arithmetic matroid and a matroid over the ring $\operatorname {End}(\mathcal {E})$. In this way, we obtain a class of arithmetic matroids that is different from the class of arithmetic matroids realizable via toric arrangements. Finally, we show that the Euler characteristic of the complement is an evaluation of the arithmetic Tutte polynomial.
Let $M^{({k})}_{d}(n)$ be the manifold of n-tuples $(x_1,\ldots,x_n)\in(\mathbb{R}^d)^n$ having non-k-equal coordinates. We show that, for $d\geq2$, $M^{({3})}_{d}(n)$ is rationally formal if and only if $n\leq6$. This stands in sharp contrast with the fact that all classical configuration spaces $M^{({2})}_d(n)=\text{Conf}(\mathbb{R}^d,n)$ are rationally formal, just as are all complements of arrangements of arbitrary complex subspaces with geometric lattice of intersections. The rational non-formality of $M^{({3})}_{d}(n)$ for $n \gt 6$ is established via detection of non-trivial triple Massey products, which are assessed geometrically through Poincaré duality.
A finite point set in $\mathbb{R}^d$ is in general position if no $d + 1$ points lie on a common hyperplane. Let $\alpha _d(N)$ be the largest integer such that any set of $N$ points in $\mathbb{R}^d$, with no $d + 2$ members on a common hyperplane, contains a subset of size $\alpha _d(N)$ in general position. Using the method of hypergraph containers, Balogh and Solymosi showed that $\alpha _2(N) \lt N^{5/6 + o(1)}$. In this paper, we also use the container method to obtain new upper bounds for $\alpha _d(N)$ when $d \geq 3$. More precisely, we show that if $d$ is odd, then $\alpha _d(N) \lt N^{\frac {1}{2} + \frac {1}{2d} + o(1)}$, and if $d$ is even, we have $\alpha _d(N) \lt N^{\frac {1}{2} + \frac {1}{d-1} + o(1)}$. We also study the classical problem of determining $a(d,k,n)$, the maximum number of points selected from the grid $[n]^d$ such that no $k + 2$ members lie on a $k$-flat, and improve the previously best known bound for $a(d,k,n)$, due to Lefmann in 2008, by a polynomial factor when $k$ = 2 or 3 (mod 4).
The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least $-\lambda $ can be defined by a finite set of forbidden induced subgraphs if and only if $\lambda < \lambda ^*$, where $\lambda ^* = \rho ^{1/2} + \rho ^{-1/2} \approx 2.01980$, and $\rho $ is the unique real root of $x^3 = x + 1$. This resolves a question raised by Bussemaker and Neumaier. As a byproduct, we find all the limit points of smallest eigenvalues of graphs, supplementing Hoffman’s work on those limit points in $[-2, \infty )$.
We also prove that the same conclusion about forbidden subgraph characterization holds for signed graphs. Our impetus for the study of signed graphs is to determine the maximum cardinality of a spherical two-distance set with two fixed angles (one acute and one obtuse) in high dimensions. Denote by $N_{\alpha , \beta }(d)$ the maximum number of unit vectors in $\mathbb {R}^d$ where all pairwise inner products lie in $\{\alpha , \beta \}$ with $-1 \le \beta < 0 \le \alpha < 1$. Very recently Jiang, Tidor, Yao, Zhang, and Zhao determined the limit of $N_{\alpha , \beta }(d)/d$ as $d\to \infty $ when $\alpha + 2\beta < 0$ or $(1-\alpha )/(\alpha -\beta ) \in \{1,\sqrt 2,\sqrt 3\}$, and they proposed a conjecture on the limit in terms of eigenvalue multiplicities of signed graphs. We establish their conjecture whenever $(1-\alpha )/(\alpha - \beta ) < \lambda ^*$.
Minimal kinematics identifies likelihood degenerations where the critical points are given by rational formulas. These rest on the Horn uniformization of Kapranov–Huh. We characterize all choices of minimal kinematics on the moduli space $\mathcal{M}_{0,n}$. These choices are motivated by the CHY model in physics and they are represented combinatorially by 2-trees. We compute 2-tree amplitudes, and we explore extensions to non-planar on-shell diagrams, here identified with the hypertrees of Castravet–Tevelev.
In [5], a particular family of real hyperplane arrangements stemming from hyperpolygonal spaces associated with certain quiver varieties was introduced which we thus call hyperpolygonal arrangements${\mathscr H}_n$. In this note, we study these arrangements and investigate their properties systematically. Remarkably, the arrangements ${\mathscr H}_n$ discriminate between essentially all local properties of arrangements. In addition, we show that hyperpolygonal arrangements are projectively unique and combinatorially formal.
We note that the arrangement ${\mathscr H}_5$ is the famous counterexample of Edelman and Reiner [17] of Orlik’s conjecture that the restriction of a free arrangement is again free.
The present paper explores a connection between two concepts arising from different fields of mathematics. The first concept, called vine, is a graphical model for dependent random variables. This concept first appeared in a work of Joe (1994), and the formal definition was given later by Cooke (1997). Vines have nowadays become an active research area whose applications can be found in probability theory and uncertainty analysis. The second concept, called MAT-freeness, is a combinatorial property in the theory of freeness of logarithmic derivation modules of hyperplane arrangements. This concept was first studied by Abe-Barakat-Cuntz-Hoge-Terao (2016), and soon afterwards investigated further by Cuntz-Mücksch (2020).
In the particular case of graphic arrangements, the last two authors (2023) recently proved that the MAT-freeness is completely characterized by the existence of certain edge-labeled graphs, called MAT-labeled graphs. In this paper, we first introduce a poset characterization of a vine. Then we show that, interestingly, there exists an explicit equivalence between the categories of locally regular vines and MAT-labeled graphs. In particular, we obtain an equivalence between the categories of regular vines and MAT-labeled complete graphs.
Several applications will be mentioned to illustrate the interaction between the two concepts. Notably, we give an affirmative answer to a question of Cuntz-Mücksch that MAT-freeness can be characterized by a generalization of the root poset in the case of graphic arrangements.
Given any smooth germ of a 3-fold flopping contraction, we first give a combinatorial characterisation of which Gopakumar–Vafa (GV) invariants are non-zero, by prescribing multiplicities to the walls in the movable cone. On the Gromov–Witten (GW) side, this allows us to describe, and even draw, the critical locus of the associated quantum potential. We prove that the critical locus is the infinite hyperplane arrangement of Iyama and the second author and, moreover, that the quantum potential can be reconstructed from a finite fundamental domain. We then iterate, obtaining a combinatorial description of the matrix that controls the transformation of the non-zero GV invariants under a flop. There are three main ingredients and applications: (1) a construction of flops from simultaneous resolution via cosets, which describes how the dual graph changes; (2) a closed formula, which describes the change in dimension of the contraction algebra under flop; and (3) a direct and explicit isomorphism between quantum cohomologies of different crepant resolutions, giving a Coxeter-style, visual proof of the Crepant Transformation Conjecture for isolated cDV singularities.
Given an affine Coxeter group W, the corresponding Shi arrangement is a refinement of the corresponding Coxeter hyperplane arrangements that was introduced by Shi to study Kazhdan–Lusztig cells for W. Shi showed that each region of the Shi arrangement contains exactly one element of minimal length in W. Low elements in W were introduced to study the word problem of the corresponding Artin–Tits (braid) group and turns out to produce automata to study the combinatorics of reduced words in W. In this article, we show, in the case of an affine Coxeter group, that the set of minimal length elements of the regions in the Shi arrangement is precisely the set of low elements, settling a conjecture of Dyer and the second author in this case. As a by-product of our proof, we show that the descent walls – the walls that separate a region from the fundamental alcove – of any region in the Shi arrangement are precisely the descent walls of the alcove of its corresponding low element.
We use the geometry of the stellahedral toric variety to study matroids. We identify the valuative group of matroids with the cohomology ring of the stellahedral toric variety and show that valuative, homological and numerical equivalence relations for matroids coincide. We establish a new log-concavity result for the Tutte polynomial of a matroid, answering a question of Wagner and Shapiro–Smirnov–Vaintrob on Postnikov–Shapiro algebras, and calculate the Chern–Schwartz–MacPherson classes of matroid Schubert cells. The central construction is the ‘augmented tautological classes of matroids’, modeled after certain toric vector bundles on the stellahedral toric variety.
We determine all finite sets of equiangular lines spanning finite-dimensional complex unitary spaces for which the action on the lines of the set-stabiliser in the unitary group is 2-transitive with a regular normal subgroup.
Bezdek and Kiss showed that existence of origin-symmetric coverings of unit sphere in ${\mathbb {E}}^n$ by at most $2^n$ congruent spherical caps with radius not exceeding $\arccos \sqrt {\frac {n-1}{2n}}$ implies the X-ray conjecture and the illumination conjecture for convex bodies of constant width in ${\mathbb {E}}^n$, and constructed such coverings for $4\le n\le 6$. Here, we give such constructions with fewer than $2^n$ caps for $5\le n\le 15$.
For the illumination number of any convex body of constant width in ${\mathbb {E}}^n$, Schramm proved an upper estimate with exponential growth of order $(3/2)^{n/2}$. In particular, that estimate is less than $3\cdot 2^{n-2}$ for $n\ge 16$, confirming the abovementioned conjectures for the class of convex bodies of constant width. Thus, our result settles the outstanding cases $7\le n\le 15$.
We also show how to calculate the covering radius of a given discrete point set on the sphere efficiently on a computer.
In this paper, we follow and extend a group-theoretic method introduced by Greenleaf–Iosevich–Liu–Palsson (GILP) to study finite points configurations spanned by Borel sets in $\mathbb{R}^n,n\geq 2,n\in\mathbb{N}.$ We remove a technical continuity condition in a GILP’s theorem in [Revista Mat. Iberoamer31 (2015), 799–810]. This allows us to extend the Wolff–Erdogan dimension bound for distance sets to finite points configurations with k points for $k\in\{2,\dots,n+1\}$ forming a $(k-1)$ -simplex.
Neodymium magnets were independently discovered in 1984 by General Motors and Sumitomo. Today, they are the strongest type of permanent magnets commercially available. They are the most widely used industrial magnets with many applications, including in hard disk drives, cordless tools and magnetic fasteners. We use a vector potential approach, rather than the more usual magnetic potential approach, to derive the three-dimensional (3D) magnetic field for a neodymium magnet, assuming an idealized block geometry and uniform magnetization. For each field or observation point, the 3D solution involves 24 nondimensional quantities, arising from the eight vertex positions of the magnet and the three components of the magnetic field. The only unknown in the model is the value of magnetization, with all other model quantities defined in terms of field position and magnet location. The longitudinal magnetic field component in the direction of magnetization is bounded everywhere, but discontinuous across the magnet faces parallel to the magnetization direction. The transverse magnetic fields are logarithmically unbounded on approaching a vertex of the magnet.
Let $W\subset \operatorname{GL}(V)$ be a complex reflection group and $\mathscr{A}(W)$ the set of the mirrors of the complex reflections in $W$. It is known that the complement $X(\mathscr{A}(W))$ of the reflection arrangement $\mathscr{A}(W)$ is a $K(\unicode[STIX]{x1D70B},1)$ space. For $Y$ an intersection of hyperplanes in $\mathscr{A}(W)$, let $X(\mathscr{A}(W)^{Y})$ be the complement in $Y$ of the hyperplanes in $\mathscr{A}(W)$ not containing $Y$. We hope that $X(\mathscr{A}(W)^{Y})$ is always a $K(\unicode[STIX]{x1D70B},1)$. We prove it in case of the monomial groups $W=G(r,p,\ell )$. Using known results, we then show that there remain only three irreducible complex reflection groups, leading to just eight such induced arrangements for which this $K(\unicode[STIX]{x1D70B},1)$ property remains to be proved.
Holmsen, Kynčl and Valculescu recently conjectured that if a finite set $X$ with $\ell n$ points in $\mathbb{R}^{d}$ that is colored by $m$ different colors can be partitioned into $n$ subsets of $\ell$ points each, such that each subset contains points of at least $d$ different colors, then there exists such a partition of $X$ with the additional property that the convex hulls of the $n$ subsets are pairwise disjoint.
We prove a continuous analogue of this conjecture, generalized so that each subset contains points of at least $c$ different colors, where we also allow $c$ to be greater than $d$. Furthermore, we give lower bounds on the fraction of the points each of the subsets contains from $c$ different colors. For example, when $n\geqslant 2$, $d\geqslant 2$, $c\geqslant d$ with $m\geqslant n(c-d)+d$ are integers, and $\unicode[STIX]{x1D707}_{1},\ldots ,\unicode[STIX]{x1D707}_{m}$ are $m$ positive finite absolutely continuous measures on $\mathbb{R}^{d}$, we prove that there exists a partition of $\mathbb{R}^{d}$ into $n$ convex pieces which equiparts the measures $\unicode[STIX]{x1D707}_{1},\ldots ,\unicode[STIX]{x1D707}_{d-1}$, and in addition every piece of the partition has positive measure with respect to at least $c$ of the measures $\unicode[STIX]{x1D707}_{1},\ldots ,\unicode[STIX]{x1D707}_{m}$.
Over the past forty years many papers have studied logarithmic sheaves associated to reduced divisors, in particular logarithmic bundles associated to plane curves. An interesting family of these curves are the so-called free ones for which the associated logarithmic sheaf is the direct sum of two line bundles. Terao conjectured thirty years ago that when a curve is a finite set of distinct lines (i.e. a line arrangement) its freeness depends solely on its combinatorics, but this has only been proved for sets of up to 12 lines. In looking for a counter-example to Terao’s conjecture, the nearly free curves introduced by Dimca and Sticlaru arise naturally. We prove here that the logarithmic bundle associated to a nearly free curve possesses a minimal non-zero section that vanishes on one single point, P say, called the jumping point, and that this characterises the bundle. We then give a precise description of the behaviour of P. Based on detailed examples we then show that the position of P relative to its corresponding nearly free arrangement of lines may or may not be a combinatorial invariant, depending on the chosen combinatorics.