Related papers: Partial spreads and vector space partitions
In various areas of modern physics and in particular in quantum gravity or foundational space-time physics it is of great importance to be in the possession of a systematic procedure by which a macroscopic or continuum limit can be…
In the first part of this thesis, we consider an instance of Frechet distance problem in which the speed of traversal along each segment of the curves is restricted to be within a specfied range. This setting is more realistic than the…
In this paper we obtain new estimates of the sequential Caputo fractional derivatives of a function at its extremum points. We derive comparison principles for the linear fractional differential equations, and apply these principles to…
Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the codewords in such a code are subspaces of $\F_q^n$ with a given dimension. A computer search for large constant…
A vector space partition $\mathcal{P}$ in $\mathbb{F}_q^v$ is a set of subspaces such that every $1$-dimensional subspace of $\mathbb{F}_q^v$ is contained in exactly one element of $\mathcal{P}$. Replacing "every point" by "every…
We present a survey of the many and various elements of the modern higher-dimensional theory of quasiconformal mappings and their wide and varied application. It is unified (and limited) by the theme of the author's interests. Thus we will…
The aim of this survey is to provide the reader with an essential and accessible introduction to the theory of Weierstrass semigroups, in the context of the theory developed by K.-O. St\"ohr and J.F. Voloch. Furthermore, we discuss an…
We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated…
Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…
We study the cutwidth measure on graphs and ways to bound the cutwidth of a graph by partitioning its vertices. We consider bounds expressed as a function of two quantities: on the one hand, the maximal cutwidth y of the subgraphs induced…
In this paper, we study flag codes on the vector space $\mathbb{F}_q^n$, being $q$ a prime power and $\mathbb{F}_q$ the finite field of $q$ elements. More precisely, we focus on flag codes that attain the maximum possible distance (optimum…
We identify the stochastic processes associated with one-sided fractional partial differential equations on a bounded domain with various boundary conditions. This is essential for modelling using spatial fractional derivatives. We show…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
In this note we present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2,...} or on the open half-line (0,+\infty). The main result is the computation of the…
The most fundamental notion for Hilbert space frames is the sequence of frame coefficients for a vector x in the space. Yet, we know little about the distribution of these coefficient sequences. In this paper, we make the first detailed…
We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields. A short and self-contained account of some recent progress on this…
In 2009, Berkovich and Garvan introduced a new partition statistic called the GBG-rank modulo $t$ which is a generalization of the well-known BG-rank. In this paper, we use the Littlewood decomposition of partitions to study partitions with…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…
This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…