Related papers: Tissus alg\'ebriques exceptionnels

We continue our earlier investigation of dp-finite fields. We show that the "heavy sets" of [6] are exactly the sets of full dp-rank. As a consequence, full dp-rank is a definable property in definable families of sets. If $I$ is the group…

Let $C$ be a nonsingular irreducible projective curve of genus $g\ge2$ defined over the complex numbers. Suppose that $1\le n'\le n-1$ and $n'd-nd'=n'(n-n')(g-1)$. It is known that, for the general vector bundle $E$ of rank $n$ and degree…

Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…

In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our…

We generalize to webs of any codimension results already known in codimension one. Given a holomorphic $d$-web $\cal W$ of codimension $q$ $(q\leq n-1)$ in an ambiant $n$-dimensional holomorphic manifold $U$, we define for any integer $p$…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

Motivated by the study of algebraic classes in mixed characteristic we define a countable subalgebra of $\bar{\mathbb{Q}}_p$ which we call the algebra of Andr\'e's $p$-adic periods. We construct a tannakian framework to study these periods.…

The matching number of a $k$-graph is the maximum number of pairwise disjoint edges in it. The $k$-graph is called $t$-resilient if omitting $t$ vertices never decreases its matching number. The complete $k$-graph on $sk+k-1$ vertices has…

We extend results related to maximal subalgebras and ideals from Lie to Leibniz algebras. In particular, we classify minimal non-elementary Leibniz algebras and Leibniz algebras with a unique maximal ideal. In both cases, there are types of…

We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…

Let $D$ be a strong balanced digraph on $2a$ vertices. Adamus et al. have proved that $D$ is hamiltonian if $d(u)+d(v)\ge 3a$ whenever $uv\notin A(D)$ and $vu\notin A(D)$. The lower bound $3a$ is tight. In this paper, we shall show that the…

We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…

Ryser's Conjecture states that any $r$-partite $r$-uniform hypergraph has a vertex cover of size at most $r - 1$ times the size of the largest matching. For $r = 2$, the conjecture is simply K\"onig's Theorem and every bipartite graph is a…

Confocal conics form an orthogonal net. Supplementing this net with one of the following: 1) the net of Cartesian coordinate lines aligned along the principal axes of conics, 2) the net of Apollonian pencils of circles whose foci coincide…

The restricted online Ramsey numbers were introduced by Conlon, Fox, Grinshpun and He in 2019. In a recent paper, Briggs and Cox studied the restricted online Ramsey numbers of matchings and determined a general upper bound for them. They…

Let $G$ be a finite group, $A$ a unital separable finite simple nuclear C*-algebra, and $\alpha$ an action of $G$ on $A$. Assume that $A$ absorbs the Jiang-Su algebra $\mathcal{Z}$, the extremal boundary of the trace space of $A$ is compact…

In the introduction of this paper we discuss a possible approach to the unitarizability problem for classical p-adic groups. In this paper we give some very limited support that such approach is not without chance. In a forthcoming paper we…

Let $G$ be a finite simple group of Lie type and let $T$ be a maximal torus of $G$. It is well known that if the defining field of $G$ is large enough, then the normaliser of $T$ in $G$ is equal to the algebraic normaliser $N(G,T)$. We…

We show that locally acyclic cluster algebras have (at worst) canonical singularities. In fact, we prove that locally acyclic cluster algebras of positive characteristic are strongly F-regular. In addition, we show that upper cluster…

Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well-founded,…