相关论文: The Gr\"unbaum--Rigby configuration as a special K…

When searching for small 4-configurations of points and lines, polycyclic configurations, in which every symmetry class of points and lines contains the same number of elements, have proved to be quite useful. In this paper we construct and…

In a series of papers and in his 2009 book on configurations Branko Gr\"unbaum described a sequence of operations to produce new $(n_{4})$ configurations from various input configurations. These operations were later called the "Gr\"unbaum…

We study relations between $(n_4)$ incidence configurations and the classical Poncelet Porism. Poncelet's result studies two conics and a sequence of points and lines that inscribes one conic and circumscribes the other. Poncelet's Porism…

The Gray configuration is a (27_3) configuration which typically is realized as the points and lines of the 3 x 3 x 3 integer lattice. It occurs as a member of an infinite family of configurations defined by Bouwer in 1972. Since their…

The "Gr\"unbaum Incidence Calculus" is the common name of a collection of operations introduced by Branko Gr\"unbaum to produce new $(n_{4})$ configurations from various input configurations. In a previous paper, we generalized two of these…

After the 1916 success of General relativity that explained gravity by adding time as a fourth dimension, physicists have been trying to explain other physical fields by adding extra dimensions. In 1921, Kaluza and Klein has shown that…

We construct a gerbe over a complex reductive Lie group G attached to an invariant bilinear form on a maximal diagonalizable subalgebra which is Weyl group invariant and satisfies a parity condition. By restriction to a maximal compact…

Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…

The $n$-star $S_n$ is the $n$-vertex triple system with ${n-1 \choose 2}$ edges all of which contain a fixed vertex, and $K_4^-$ is the unique triple system with four vertices and three edges. We prove that the Ramsey number $r(K_4^-, S_n)$…

We revisit the configuration of Danzer DCD(4), a great inspiration for our work. This configuration of type (35_4) falls into an infinite series of geometric point-line configurations DCD(n). Each DCD(n) is characterized combinatorially by…

There are six different mathematical formulations of the symmetry group in quantum mechanics, among them the set of pure states $\mathbf{P}$ -- i.e., the set of one-dimensional projections on a complex Hilbert space $H$ -- and the…

We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform Ramsey number $r_4(5,n)$, and the same for the iterated $(k-4)$-fold logarithm of the $k$-uniform…

We prove that there is a unique graph with four edges which is the Gruenberg-Kegel graph of a solvable cut group. This contributes to the classification of the Gruenberg-Kegel graphs of solvable cut groups initiated in [A. B\"achle, A.…

The equivariant cohomology of the classical configuration space $F(\mathbb{R}^d,n)$ has been been of great interest and has been studied intensively starting with the classical papers by Artin (1925/1947) on the theory of braids, by Fox and…

Lov\'asz (1987) proved that every matching covered graph $G$ may be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite); we let $b(G)$ denote the number of bricks. An edge $e$ is removable if $G-e$ is also…

For a graph $G$, let Conf$(G,n)$ denote the classical configuration space of $n$ labelled points in $G$. Abrams introduced a cubical complex, denoted here by DConf$(G,n)$, sitting inside Conf$(G,n)$ as a strong deformation retract provided…

We find conditions under which a non-orientable closed surface S embedded into an orientable closed 4-manifold X can be represented by a connected sum of an embedded closed surface in X and an unknotted projective plane in a 4-sphere. This…

We introduce an algorithm that constructs a discrete gradient field on any simplicial complex. We show that, in all situations, the gradient field is maximal possible and, in a number of cases, optimal. We make a thorough analysis of the…

A Sylvester-Gallai (SG) configuration is a finite set S of points such that the line through any two points in S contains a third point of S. According to the Sylvester-Gallai Theorem, an SG configuration in real projective space must be…

The four-bar linkage is a basic arrangement of mechanical engineering and represents the simplest movable system formed by a closed sequence of bar-shaped bodies. Although the mechanism can have in general a spatial arrangement, we focus…