Related papers: Typical and Admissible ranks over fields

We show how the recent isogeny bounds due to \'E. Gaudron and G. R\'emond allow to obtain the triviality of X_0^+ (p^r)(Q), for r>1 and p a prime exceeding 2.10^{11}. This includes the case of the curves X_split (p). We then prove, with the…

Let $G$ be a simple and simply connected algebraic group over an algebraically closed field $\Bbbk$ of characteristic $p>0$. Assume that $p$ is good for the root system of $G$ and that the covering map $G_{sc} \rightarrow G$ is separable.…

Let $V$ be an absolutely irreducible affine variety over $\mathbb{F}_p$. A Lehmer point on $V$ is a point whose coordinates satisfy some prescribed congruence conditions, and a visible point is one whose coordinates are relatively prime.…

We say that a Riemannian manifold M has rank at least k if every geodesic in M admits at least k parallel Jacobi fields. The Rank Rigidity Theorem of Ballmann and Burns-Spatzier, later generalized by Eberlein-Heber, states that a complete,…

Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that…

Let $K$ be a number field. Let $S$ be a finite set of places of $K$ containing all the archimedean ones. Let $R_S$ be the ring of $S$-integers of $K$. In the present paper we consider endomorphisms of $\pro$ of degree 2, defined over $K$,…

Given a cover $\mathbb{U}$ of a family of smooth complex algebraic varieties, we associate with it a class $\mathcal{U},$ containing $\mathbb{U}$, of structures locally definable in an o-minimal expansion of the reals. We prove that the…

Generalizing a theorem of Campercholi, we characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures (as opposed to an elementary class). This allows us to strengthen a result of…

Many graph coloring proofs proceed by showing that a minimal counterexample to the theorem being proved cannot contain certain configurations, and then showing that each graph under consideration contains at least one such configuration;…

Let $X \subset \mathbb{P}^{n}$ be an unramified real curve with $X(\mathbb{R}) \neq \emptyset$. If $n \geq 3$ is odd, Huisman conjectures that $X$ is an $M$-curve and that every branch of $X(\mathbb{R})$ is a pseudo-line. If $n \geq 4$ is…

We study definably compact definably connected groups definable in a sufficiently saturated real closed field $R$. We introduce the notion of group-generic point for $\bigvee$-definable groups and show the existence of group-generic points…

We study typical ranks with respect to a real variety $X$. Examples of such are tensor rank ($X$ is the Segre variety) and symmetric tensor rank ($X$ is the Veronese variety). We show that any rank between the minimal typical rank and the…

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

We estimate the number of principal ideals $ I $ of norm $ \mathrm{N}(I) \leq x $ in the family of the simplest cubic fields. The advantage of our result is that it provides the correct order of magnitude for arbitrary $ x \geq 1 $, even…

Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…

We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the…

To alleviate the data requirement for training effective binary classifiers in binary classification, many weakly supervised learning settings have been proposed. Among them, some consider using pairwise but not pointwise labels, when…

We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…