Related papers: A small minimal blocking set in PG(n,p^t), spannin…

The standard notion of poset probability of a finite poset P involves calculating, for incomparable $\alpha$, $\beta$ in P, the number of linear extensions of P for which $\alpha$ precedes $\beta$. The fraction of those linear extensions…

We prove that the model checking problem for the existential fragment of first-order (FO) logic on partially ordered sets is fixed-parameter tractable (FPT) with respect to the formula and the width of a poset (the maximum size of an…

The set of minimal primes of a ring is a very important set as far the spectrum of a ring is concerned as every prime contains a minimal prime. So, knowing the minimal primes is the first (important and difficult) step in describing the…

We study surfaces in Euclidean space ${\mathbb R}^3$ that are minimal for a log-linear density $\phi(x,y,z)=\alpha x+\beta y+\gamma y$, where $\alpha,\beta,\gamma$ are real numbers not all zero. We prove that if a surface is $\phi$-minimal…

We prove that every graph of rank-width $k$ is a pivot-minor of a graph of tree-width at most $2k$. We also prove that graphs of rank-width at most 1, equivalently distance-hereditary graphs, are exactly vertex-minors of trees, and graphs…

We characterise the minimum weight codewords of the $p$-ary linear code of intersecting lines in ${\rm PG}(3,q)$, $q=p^h$, $q\geq19$, $p$ prime, $h\geq 1$. If $q$ is even, the minimum weight equals $q^3+q^2+q+1$. If $q$ is odd, the minimum…

In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…

We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…

We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…

Pseudo-differential operators of type $(1,1)$ and order $m$ are continuous from $F_p^{s+m,q}$ to $F_p^{s,q}$ if $s>d/\min{(1,p,q)}-d$ for $0<p<\infty$, and from $B_p^{s+m,q}$ to $B_{p}^{s,q}$ if $s>d/\min{(1,p)}-d$ for $0<p\leq\infty$. In…

Let $p$ be any prime. We determine precisely those irreducible characters of symmetric groups which contain at most $p$ distinct linear constituents in their restriction to a Sylow $p$-subgroup, answering a question of Giannelli and…

Let $p > 155$ be a prime and let $G$ be a cyclic group of order $p$. Let $S$ be a minimal zero-sum sequence with elements over $G$, i.e., the sum of elements in $S$ is zero, but no proper nontrivial subsequence of $S$ has sum zero. We call…

We investigate closure operators and describe their properties for $E$-combinations and $P$-combinations of structures and their theories. We prove, for $E$-combinations, that the existence of a minimal generating set of theories is…

Many applications give rise to structured matrix polynomials. The problem of constructing structure-preserving strong linearizations of structured matrix polynomials is revisited in this work and in the forthcoming ones…

A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…

Motivated by a question of Erd\H{o}s on blocking sets in a projective plane that intersect every line only a few times, several authors have used unions of algebraic curves to construct such sets in $\mathbb{P}^2(\mathbb{F}_q)$. In this…

We classify the simple restricted modules for the minimal $p$-envelope of the non-graded, non-restricted Hamiltonian Lie algebra $H(2; (1,1); \Phi(1))$ over an algebraically closed field $k$ of characteristic $p \geq 5$. We also give the…