ترغب بنشر مسار تعليمي؟ اضغط هنا

The VC-dimension and point configurations in ${Bbb F}_q^2$

54   0   0.0 ( 0 )
 نشر من قبل Alex Iosevich
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Let $X$ be a set and ${mathcal H}$ a collection of functions from $X$ to ${0,1}$. We say that ${mathcal H}$ shatters a finite set $C subset X$ if the restriction of ${mathcal H}$ yields every possible function from $C$ to ${0,1}$. The VC-dimension of ${mathcal H}$ is the largest number $d$ such that there exists a set of size $d$ shattered by ${mathcal H}$, and no set of size $d+1$ is shattered by ${mathcal H}$. Vapnik and Chervonenkis introduced this idea in the early 70s in the context of learning theory, and this idea has also had a significant impact on other areas of mathematics. In this paper we study the VC-dimension of a class of functions ${mathcal H}$ defined on ${Bbb F}_q^d$, the $d$-dimensional vector space over the finite field with $q$ elements. Define $$ {mathcal H}^d_t={h_y(x): y in {Bbb F}_q^d },$$ where for $x in {Bbb F}_q^d$, $h_y(x)=1$ if $||x-y||=t$, and $0$ otherwise, where here, and throughout, $||x||=x_1^2+x_2^2+dots+x_d^2$. Here $t in {Bbb F}_q$, $t ot=0$. Define ${mathcal H}_t^d(E)$ the same way with respect to $E subset {Bbb F}_q^d$. The learning task here is to find a sphere of radius $t$ centered at some point $y in E$ unknown to the learner. The learning process consists of taking random samples of elements of $E$ of sufficiently large size. We are going to prove that when $d=2$, and $|E| ge Cq^{frac{15}{8}}$, the VC-dimension of ${mathcal H}^2_t(E)$ is equal to $3$. This leads to an intricate configuration problem which is interesting in its own right and requires a new approach.

قيم البحث

اقرأ أيضاً

Bimonotone subdivisions in two dimensions are subdivisions all of whose sides are either vertical or have nonnegative slope. They correspond to statistical estimates of probability distributions of strongly positively dependent random variables. The number of bimonotone subdivisions compared to the total number of subdivisions of a point configuration provides insight into how often the random variables are positively dependent. We give recursions as well as formulas for the numbers of bimonotone and total subdivisions of $2times n$ grid configurations in the plane. Furthermore, we connect the former to the large Schroder numbers. We also show that the numbers of bimonotone and total subdivisions of a $2times n$ grid are asymptotically equal. We then provide algorithms for counting bimonotone subdivisions for any $m times n$ grid. Finally, we prove that all bimonotone triangulations of an $m times n$ grid are connected by flips. This gives rise to an algorithm for counting the number of bimonotone (and total) triangulations of an $mtimes n$ grid.
We investigate the asymptotic rates of length-$n$ binary codes with VC-dimension at most $dn$ and minimum distance at least $delta n$. Two upper bounds are obtained, one as a simple corollary of a result by Haussler and the other via a shortening app roach combining Sauer-Shelah lemma and the linear programming bound. Two lower bounds are given using Gilbert-Varshamov type arguments over constant-weight and Markov-type sets.
Achieving multiferroic two-dimensional (2D) materials should enable numerous functionalities in nanoscale devices. Until now, however, predicted 2D multiferroics are very few and with coexisting yet only loosely coupled (type-I) ferroelectricity and magnetism. Here, a type-II multiferroic MXene Hf$_{2}$VC$_{2}$F$_{2}$ monolayer is identified, where ferroelectricity originates directly from its magnetism. The noncollinear Y-type spin order generates a polarization perpendicular to the spin helical plane. Remarkably, the multiferroic transition is estimated to occur above room temperature. Our investigation should open the door to a new branch of 2D materials for pursuit of intrinsically strong magnetoelectricity.
A emph{sign pattern (matrix)} is a matrix whose entries are from the set ${+, -, 0}$. The emph{minimum rank} (respectively, emph{rational minimum rank}) of a sign pattern matrix $cal A$ is the minimum of the ranks of the real (respectively, rational) matrices whose entries have signs equal to the corresponding entries of $cal A$. A sign pattern $cal A$ is said to be emph{condensed} if $cal A$ has no zero row or column and no two rows or columns are identical or negatives of each other. In this paper, a new direct connection between condensed $m times n $ sign patterns with minimum rank $r$ and $m$ point--$n$ hyperplane configurations in ${mathbb R}^{r-1}$ is established. In particular, condensed sign patterns with minimum rank 3 are closed related to point--line configurations on the plane. It is proved that for any sign pattern $cal A$ with minimum rank $rgeq 3$, if the number of zero entries on each column of $cal A$ is at most $r-1$, then the rational minimum rank of $cal A$ is also $r$. Furthermore, we construct the smallest known sign pattern whose minimum rank is 3 but whose rational minimum rank is greater than 3.
We study a family of variants of ErdH os unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for bounds on how ma ny subsets of $k$ points satisfy a set of relationships between point pairs based on distances or dot products. We survey some of the recent work in the area and present several new, more general families of bounds.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا