Related papers: Partition dimension of projective planes

The problem of multiway partitioning of an undirected graph is considered. A spectral method is used, where the k > 2 largest eigenvalues of the normalized adjacency matrix (equivalently, the k smallest eigenvalues of the normalized graph…

Motivated by the theorem of Gy\H ori and Lov\'asz, we consider the following problem. For a connected graph $G$ on $n$ vertices and $m$ edges determine the number $P(G,k)$ of unordered solutions of positive integers $\sum_{i=1}^k m_i = m$…

An equitable $k$-partition of a graph $G$ is a collection of induced subgraphs $(G[V_1],G[V_2],\ldots,G[V_k])$ of $G$ such that $(V_1,V_2,\ldots,V_k)$ is a partition of $V(G)$ and $-1\le |V_i|-|V_j|\le 1$ for all $1\le i<j\le k$. We prove…

We construct a cover of the non-incident point-hyperplane graph of projective dimension 3 for fields of characteristic 2. If the cardinality of the field is larger than 2, we obtain an elementary construction of the non-split extension of…

Let $E$ be a vector bundle over a smooth curve $C$, and $S = \mathbb{P} E$ the associated projective bundle. We describe the inflectional loci of certain projective models $\psi \colon S \dashrightarrow \mathbb{P}^n$ in terms of Quot…

The small-angle scattering curves of deterministic mass fractals are studied and analyzed in the momentum space. In the fractal region, the curve I(q)q^D is found to be log-periodic with a good accuracy, and the period is equal to the…

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

Let $G = (V, E)$ be a connected graph with maximum degree $k\geq 3$ distinct from $K_{k+1}$. Given integers $s \geq 2$ and $p_1,\ldots,p_s\geq 0$, $G$ is said to be $(p_1, \dots, p_s)$-partitionable if there exists a partition of $V$ into…

Let $n,k$ denote integers with $n>2k\geq 6$. Let $\mathbb{F}_q$ denote a finite field with $q$ elements, and let $V$ denote a vector space over $\mathbb{F}_q$ that has dimension $n$. The projective geometry $P_q(n)$ is the partially ordered…

Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\pi$ of the vertex set of $G$ into…

The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.

Recently, Prasad and Yeung classified all possible fundamental groups of fake projective planes. According to their result, many fake projective planes admit a nontrivial group of automorphisms, and in that case it is isomorphic to…

Let A be a unital C*-algebra. Denote by P the space of selfadjoint projections of A. We study the relationship between P and the spaces of projections P_a determined by the different involutions #_a induced by positive invertible elements a…

In this work we construct a new class of maximal partial spreads in $PG(4,q)$, that we call $q$-added maximal partial spreads. We obtain them by depriving a spread of a hyperplane of some lines and adding $q+1$ lines not of the hyperplane…

For prime powers q, let s(q) denote the probability that a randomly-chosen principally-polarized abelian surface over the finite field F_q is not simple. We show that there are positive constants B and C such that for all q, B (log…

Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its…

Using a simple and generic molecular dynamics model, we study the damage in a disc of interacting particles as the disc fragments upon impact with a wall. The damage, defined as the ratio of the number of bonds broken by the impact to the…

A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a…

Cutting planes are a key ingredient to successfully solve mixed-integer linear programs. For specific problems, their strength is often theoretically assessed by showing that they are facet-defining for the corresponding mixed-integer hull.…

Let $G$ be a finite simple graph on $n$ vertices, that contains no isolated vertices, and let $I(G) \subseteq S = K[x_1, \dots, x_n]$ be its edge ideal. In this paper, we study the pair of integers that measure the projective dimension and…