Related papers: Partition dimension of projective planes

We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon's product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of…

A partition P of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of P. The partition dimension of G is the minimum cardinality of a…

Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…

This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…

The space of codimension one holomorphic foliations of degree 1 in a projective space has an irreducible component whose general element is a logarithmic differential 1-form with simple poles in three hyperplanes. We compute its projective…

We consider the structure of the plane-line incidence matrix of the projective space $\mathrm{PG}(3,q)$ with respect to the orbits of planes and lines under the stabilizer group of the twisted cubic. Structures of submatrices with…

Given a set of vertices $S=\{v_1,v_2,...,v_k\}$ of a connected graph $G$, the metric representation of a vertex $v$ of $G$ with respect to $S$ is the vector $r(v|S)=(d(v,v_1),d(v,v_2),...,d(v,v_k))$, where $d(v,v_i)$, $i\in \{1,...,k\}$…

Let $L=\mathbb F_{q^n}$ be a finite field and let $F=\mathbb F_q$ be a subfield of $L$. Consider $L$ as a vector space over $F$ and the associated projective space that is isomorphic to ${\mathrm{PG}}(n-1,q)$. The properties of the…

Let $\phi$ be a collineation of $\mathrm{PG}\left(2, q^{3}\right)$ of order 3 which fixes a plane of order $q$ pointwise. The points of $\mathrm{PG}\left(2, q^{3}\right)$ can be partitioned into three types with respect to orbits of $\phi$…

Given a two-level regular fractional factorial design of resolution IV, the method of doubling produces another design of resolution IV which doubles both the run size and the number of factors of the initial design. On the other hand, the…

Let $G$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. For an ordered $k$-partition $\Pi=\{Q_1,\ldots,Q_k\}$ of $V(G)$, the representation of a vertex $v \in V(G)$ with respect to $\Pi$ is the $k$-vectors…

Let $G=(V,E)$ be a connected graph. The distance between two vertices $u,v\in V$, denoted by $d(u, v)$, is the length of a shortest $u-v$ path in $G$. The distance between a vertex $v\in V$ and a subset $P\subset V$ is defined as $min\{d(v,…

The "separation dimension" of a graph $G$ is the minimum positive integer $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a…

The elementary divisors of the incidence matrix of lines in PG(3,q) are computed, where two lines are incident if and only if they are skew.

We give an alternate proof of Schnyder's Theorem, that the incidence poset of a graph $G$ has dimension at most three if and only if $G$ is planar.

Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…

We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axis-aligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is $O(\log\log n)$.…

In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space…

We improve on the lower bound of the maximum number of planes in $\operatorname{PG}(8,q)\cong\F_q^{9}$ pairwise intersecting in at most a point. In terms of constant dimension codes this leads to $A_q(9,4;3)\ge q^{12}+…

Fixing $n$ general points $p_i$ in the plane, what is the dimension of the space of plane curves of degree $d$ having multiplicity $m_i$ at $p_i$ for each $i$? In this article we propose an approach to attack this problem, and demonstrate…