相关论文: Extremal sizes of subspace partitions

In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $ f(n) $ of parts of smaller diameter into which an arbitrary set of diameter 1 in…

A $q$-analogue of a $t$-design is a set $S$ of subspaces (of dimension $k$) of a finite vector space $V$ over a field of order $q$ such that each $t$ subspace is contained in a constant $\lambda$ number of elements of $S$. The smallest…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…

We are looking for integer numbers $g_{j}$ and $x_{j}$ ($j=1,...,n$) such that the sums $T_{\pi} := \sum_{j=1}^{n} g_{j} \cdot x_{\pi\left( j\right) }$ are different for all permutations $\pi\in S_{n}$ and $\max\left\{T_{\pi}:\pi\in…

A finite subset $X$ on the unit sphere $\mathbb{S}^{d-1}$ is called an $s$-distance set with strength $t$ if its angle set $A(X):=\{\langle \mathbf{x},\mathbf{y}\rangle : \mathbf{x},\mathbf{y}\in X,\mathbf{x}\neq\mathbf{y} \}$ has size $s$,…

Consider the geometric range space $(X, \mathcal{H}_d)$ where $X \subset \mathbb{R}^d$ and $\mathcal{H}_d$ is the set of ranges defined by $d$-dimensional halfspaces. In this setting we consider that $X$ is the disjoint union of a red and…

For a given $\pi=(\pi_0, \pi_1,..., \pi_k) \in \{0, 1, *\}^{k+1}$, we want to determine whether an input $k$-uniform hypergraph $G=(V, E)$ has a partition $(V_1, V_2)$ of the vertex set so that for all $X \subseteq V$ of size $k$, $X \in E$…

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

Andrews and Newman introduced the minimal excludant or ``$mex$'' function for an integer partition $\pi$ of a positive integer $n$, $mex(\pi)$, as the smallest positive integer that is not a part of $\pi$. They defined $\sigma mex(n)$ to be…

The biclique partition number of a graph $G= (V,E)$, denoted $bp(G)$, is the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that $…

For a positive integer $n$, the full transformation semigroup $T_n$ consists of all self maps of the set $\{1,\ldots,n\}$ under composition. Any finite semigroup $S$ embeds in some $T_n$, and the least such $n$ is called the (minimum…

$ \newcommand{\epsA}{\Mh{\delta}} \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \renewcommand{\P}{P} \newcommand{\diam}{\Delta} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q}…

For a finite dimensional representation $V$ of a group $G$ over a field $F$, the degree of reductivity $\delta(G,V)$ is the smallest degree $d$ such that every nonzero fixed point $v\in V^{G}\setminus\{0\}$ can be separated from zero by a…

In the context of constant--dimension subspace codes, an important problem is to determine the largest possible size $A_q(n, d; k)$ of codes whose codewords are $k$-subspaces of $\mathbb{F}_q^n$ with minimum subspace distance $d$. Here in…

A covering array $CA(N; t,k,v)$ is an $N \times k$ array $A$ whose each cell takes a value for a $v$-set $V$ called an alphabet. Moreover, the set $V^t$ is contained in the set of rows of every $N \times t$ subarray of $A$. The parameter…

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

We study Schmidt rank for a vector (i.e., a pure state) and Schmidt number for a mixed state which are entanglement measures. We show that if a subspace of a certain bipartite system contains no vector of Schmidt rank $\leqslant k$, then…

Consider a geometric range space $(X,\c{A})$ where each data point $x \in X$ has two or more values (say $r(x)$ and $b(x)$). Also consider a function $\Phi(A)$ defined on any subset $A \in (X,\c{A})$ on the sum of values in that range e.g.,…

Let $q$ be a power of a prime $p$, and let $V$ be an $n$-dimensional space over the field GF$(q)$. A $Z_p$-valued function $C$ on the set of $k$-dimensional subspaces of $V$ is called a $k$-uniform $Z_p$-null design of strength $t$ if for…