相关论文: On resolvable Steiner 2-designs and maximal arcs i…

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

The study of combinatorial designs has a rich history spanning nearly two centuries. In a recent breakthrough, the notorious Existence Conjecture for Combinatorial Designs dating back to the 1800s was proved in full by Keevash via the…

A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns…

In this paper various Steiner systems $S(2,k,v)$ for $k = 6$ are collected and enumerated for specific constructions. In particular, two earlier unknown types of $1$-rotational designs are found for the groups $SL(2,5)$ and $((\mathbb Z_3…

We give a complete classification of semistable rank two sheaves on three-dimensional projective space with maximal third Chern character. This implies an explicit description of their moduli spaces. As an open subset they contain rank two…

Let C be a projective smooth curve of genus g> 1. Let E be a vector bundle of rank r on C. For each integer r'<r, associate to E the invariant s_{r'}(E)=r'deg(E)-rdeg(E') where E'is a subbundle of E of rank r' and maximal degree. For every…

Let k>=3 be an integer, we prove that the maximum induced density of the k-vertex directed star in a directed graph is attained by an iterated blow-up construction. This confirms a conjecture by Falgas-Ravry and Vaughan, who proved this for…

An arc is a set of vectors of the $k$-dimensional vector space over the finite field with $q$ elements ${\mathbb F}_q$, in which every subset of size $k$ is a basis of the space, i.e. every $k$-subset is a set of linearly independent…

This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…

As one of the seven open problems in the addendum to their 1989 book "Computability in Analysis and Physics", Pour-El and Richards proposed ``... the recursion theoretic study of particular nonlinear problems of classical importance.…

We prove that maximal annuli in $\mathbb{L}^{3}$ bounded by circles, straight lines or cone points in a pair of parallel spacelike planes are part of either a Lorentzian catenoid or a Lorentzian Riemann's example. We show that under the…

Stein (2020) conjectured that for any positive integer $k$, every oriented graph of minimum semi-degree greater than $k/2$ contains every oriented path of length $k$. This conjecture is true for directed paths by a result from Jackson (JGT,…

In this exposition-type note we present detailed proofs of certain assertions concerning several algebraic properties of the cone and cylinder algebras. These include a determination of the maximal ideals, the solution of the B\'ezout…

Recently, Malle and Navarro put forward a projective version of Brauer's celebrated height zero conjecture on blocks of finite groups. In this short note we show that Brauer's original conjecture implies the projective version.

We present exact solutions of the incompressible Navier-Stokes equations in a background linear shear flow. The method of construction is based on Kelvin's investigations into linearized disturbances in an unbounded Couette flow. We obtain…

A $2$-$(v,k,\lambda)$ design is additive (or strongly additive) if it is possible to embed it in a suitable abelian group $G$ in such a way that its block set is contained in (or coincides with) the set of all the zero-sum $k$-subsets of…

Very recently Richter and Rogers proved that any convex geometry can be represented by a family of convex polygons in the plane. We shall generalize their construction and obtain a wide variety of convex shapes for representing convex…

We study identifiability for bilinear inverse problems under sparsity and subspace constraints. We show that, up to a global scaling ambiguity, almost all such maps are injective on the set of pairs of sparse vectors if the number of…

In this paper, it is proved that certain stable rank-3 vector bundles can be written as extensions of line bundles and stable rank-2 bundles. As an application, we show the rationality of certain moduli spaces of stable rank-3 bundles over…

We derive general linear programming bounds for spherical $(k,k)$-designs. This includes lower bounds for the minimum cardinality and lower and upper bounds for minimum and maximum energy, respectively. As applications we obtain a universal…