Related papers: Saturating linear sets in PG$(2,q^4)$

For a graph $F$, we say that another graph $G$ is $F$-saturated, if $G$ is $F$-free and adding any edge to $G$ would create a copy of $F$. We study for a given graph $F$ and integer $n$ whether there exists a regular $n$-vertex…

We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…

Given a graph $F$ and a positive integer $n$, the weak $F$-saturation number $\mathrm{wsat}(K_n,F)$ is the minimum number of edges in a graph $H$ on $n$ vertices such that the edges missing in $H$ can be added, one at a time, so that every…

The problem of classifying linear systems of conics in projective planes dates back at least to Jordan, who classified pencils (one-dimensional systems) of conics over $\mathbb{C}$ and $\mathbb{R}$ in 1906--1907. The analogous problem for…

We introduce the notion of saturated sets of primes of an algebraic number field and prove an analogue of Riemann's existence theorem for the decomposition groups of infinite stably saturated sets of primes.

The set of primes where a hypergeomeric series with rational parameters is $p$-adically bounded is known by [10] to have a Dirichlet density. We establish a formula for this Dirichlet density and conjecture that it is rare for the density…

An edge dominating set of a graph G=(V,E) is a subset M of edges in the graph such that each edge in E-M is incident with at least one edge in M. In an instance of the parameterized edge dominating set problem we are given a graph G=(V,E)…

This paper investigates the generalized rank weights, with a definition implied by the study of the generalized rank weight enumerator. We study rank metric codes over $L$, where $L$ is a finite Galois extension of a field $K$. This is a…

This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by $\bar{EDS}$) and the vertex packing problem (denoted by $\bar{DS} $) are linear programming…

For a given projective variety $X$, the high rank loci are the closures of the sets of points whose $X$-rank is higher than the generic one. We show examples of strict inclusion between two consecutive high rank loci. Our first example is…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g,n) = (3,0)$ or $g + n \geq 5$, then there is an exhaustion of…

We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.

Given $k$ input graphs $G_1, \dots ,G_k$, where each pair $G_i$, $G_j$ with $i \neq j$ shares the same graph $G$, the problem Simultaneous Embedding With Fixed Edges (SEFE) asks whether there exists a planar drawing for each input graph…

We study the saturation properties of several classes of $C^*$-algebras. Saturation has been shown by Farah and Hart to unify the proofs of several properties of coronas of $\sigma$-unital $C^*$-algebras; we extend their results by showing…

We determine the density of integral binary forms of given degree that have squarefree discriminant, proving for the first time that the lower density is positive. Furthermore, we determine the density of integral binary forms that cut out…

Let $X$ be a proper, geodesically complete CAT(0) space which satisfies Chen and Eberlein's duality condition. We show the existence of a strong notion of rank for $X$ by proving that the parallel sets $P_v$ of geodesics $v$ in $X$ are…

Block full rank pencils introduced in [Dopico et al., Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems, Linear Algebra Appl., 2020] allow us to obtain local information…

We study linear series on a general curve of genus g, whose images are exceptional with respect to their secant planes. Each such exceptional secant plane is algebraically encoded by an included linear series, whose number of base points…

We develop a new technique for studying ranks of multiplication maps for linear series via limit linear series and degenerations to chains of genus-1 curves. We use this approach to prove a purely elementary criterion for proving cases of…

Let $G$ be a graph and $\mathcal{F}$ be a family of graphs. We say a graph $G$ is $\mathcal{F}$-saturated if $G$ does not contain any member in $\mathcal{F}$ and for any $e\in E(\overline{G})$, $G+e$ creates a copy of some member in $…