Related papers: Typical and Admissible ranks over fields

Let $C$ be a curve of genus at least three defined over a number field, and let $r$ be the rank of the rational points of its Jacobian. Under mild hypotheses on $r$, recent results by Katz, Rabinoff, Zureick-Brown, and Stoll bound the…

Let $\sigma_b(X_{m,d}(\mathbb {C}))(\mathbb {R})$, $b(m+1) < \binom{m+d}{m}$, denote the set of all degree $d$ real homogeneous polynomials in $m+1$ variables (i.e. real symmetric tensors of format $(m+1)\times ... \times (m+1)$, $d$ times)…

Motivated by the pervasiveness of strong inapproximability results for Max-CSPs, we introduce a relaxed notion of an approximate solution of a Max-CSP. In this relaxed version, loosely speaking, the algorithm is allowed to replace the…

We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…

We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely…

We show that a variety $\mathcal V$ is congruence distributive if and only if there is some $h$ such that the inclusion (1) $\Theta \cap ( \sigma \circ \sigma ) \subseteq ( \Theta \cap \sigma ) \circ ( \Theta \cap \sigma ) \circ \dots $…

Let $K$ be an algebraically closed field of arbitrary characteristic, $X$ an irreducible variety and $Y$ an irreducible projective variety over $K$, both are not necessarily smooth. Let $f:X\rightarrow X$ and $g:Y\rightarrow Y$ be dominant…

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

Let $(K,v)$ be a henselian valued field. Let $\mathbb{P}^{dless}\subset K[x]$ be the set of monic, irreducible polynomials which are defectless and have degree greater than one. For a certain equivalence relation $\,\approx\,$ on…

A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…

We study the asymptotic rank of adjacency matrices of a large class of edge-weighted configuration models. Here, the weight of a (multi-)edge can be any fixed non-zero element from an arbitrary field, as long as it is independent of the…

We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…

We show that one can always identify a point on an algebraic variety $X$ uniquely with $\dim X +1$ generic linear measurements taken themselves from a variety under minimal assumptions. As illustrated by several examples the result is…

In this note, we show various minimality results for a geometric theory of fields $T$: $T$ is stable if and only if it is strongly minimal, $T$ is simple if and only if it has SU-rank 1, and $T$ is rosy if and only if $T$ is surgical.…

In lexicon-based classification, documents are assigned labels by comparing the number of words that appear from two opposed lexicons, such as positive and negative sentiment. Creating such words lists is often easier than labeling…

This work introduces the concept of \emph{upper-critical graphs}, in a complementary way of the conventional (lower)critical graphs: an element $x$ of a graph $G$ is called \emph{critical} if $\chi(G-x)<\chi(G)$. It is said that $G$ is a…

A complex projective manifold is rationally connected, resp. rationally simply connected, if finite subsets are connected by a rational curve, resp. the spaces parameterizing these connecting rational curves are themselves rationally…

We consider the problem of classifying (possibly noncommutative) R-algebras of low rank over an arbitrary base ring R. We first classify algebras by their degree, and we relate the class of algebras of degree 2 to algebras with a standard…