Related papers: The higher sharp IV: the higher levels

We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among other things, this gives some true co-analytic sets. The case where the dictionary is…

We study the volume of maximal representations from a surface group into $\mathrm{SO}_0(2,3)$. We show that it is bounded from above, uniformly in the genus of the surface. We also prove that on the Gothen components, it is bounded from…

The aim of these notes is to introduce the intuition motivating the notion of a "complicial set", a simplicial set with certain marked "thin" simplices that witness a composition relation between the simplices on their boundary. By varying…

Over fields of characteristic zero, we show that for $n=1,d\geq4$ or $n=2,d\geq5$ or $n\geq3, d\geq 2n$, the generic $m$-marked degree-$d$ hypersurface in $\mathbb{P}^{n+1}$ admits the $m$ marked points as all the rational points. Over…

Let $N_{g,n}$ denote the nonorientable surface of genus $g$ with $n$ boundary components and $M(N_{g,n})$ its mapping class group. We obtain an explicit finite presentation of $M(N_{g,n})$ for $n=0,1$ and all $g$ such that $g+n>3$.

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

$n$-ary algebras of the first degeneration level are described. A detailed classification is given in the cases $n=2,3$.

We study learning problems in which the underlying class is a bounded subset of $L_p$ and the target $Y$ belongs to $L_p$. Previously, minimax sample complexity estimates were known under such boundedness assumptions only when $p=\infty$.…

We prove rigidity results for holomorphic proper maps from the complex unit ball $\mathbb{B}^n$ to the Type IV bounded symmetric domain $D^{IV}_m$ where $n \geq 4, n+1\leq m \leq 2n-3$. In addition, a classification result is established…

The mouse is one of the most studied animal models in the field of systems neuroscience. Understanding the generalized patterns and decoding the neural representations that are evoked by the diverse range of natural scene stimuli in the…

We give an $O^*(1.0821^n)$-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem.

We describe some forms with greater Waring rank than previous examples. In $3$ variables we give forms of odd degree with strictly greater rank than the ranks of monomials, the previously highest known rank. This narrows the possible range…

This is the third in a series of papers extending Martin-L\"of's meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higher-dimensional types. We extend this framework to include a…

A unified matrix-vector representation is developed of such solution concepts as the core, the uncovered, the uncaptured, the minimal weakly stable, the minimal undominated, the minimal dominant and the untrapped sets. We also propose…

We sharpen earlier work on the pro-$p$ completions of orientable $PD_3$-groups. There are four cases, and we give examples of aspherical 3-manifolds representing each case. In three of the four cases the new results are best possible. We…

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.

For any n>3, we give a family of finite dimensional irreducible representations of the braid group B_n. Moreover, we give a subfamily parametrized by 0<m<n of dimension the combinatoric number (n,m). The representation obtained in the case…

Let $N_n(X)$ denote the number of degree $n$ number fields with discriminant bounded by $X$. In this note, we improve the best known upper bounds on $N_n(X)$, finding that $N_n(X) = O(X^{ c (\log n)^2})$ for an explicit constant $c$.

We present a computationally efficient algorithm that is suitable for graphic processing unit implementation. This algorithm enables the identification of all weak pseudo-manifolds that meet specific facet conditions, drawn from a given…

The complex affine quadric $Q^{m}=\{z\in {\Bbb C}^{m+1}\mid z_{1}^{2}+...+z_{m+1}^{2}=1\}$ deforms by retraction onto $S^{m}$; this allows us to identify $[Q^{k},Q^{n}]$ and $[S^{k},S^{n}]=\pi_{k}(S^{n})$. Thus one will say that an element…