中文
相关论文

相关论文: Maximum in-general-position set in a random subset…

200 篇论文

For an arbitrary $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ we study the problem of finding those $q$-polynomials $g$ over $\mathbb{F}_{q^n}$ for which the image sets of $f(x)/x$ and $g(x)/x$ coincide. For $n\leq 5$ we provide sufficient…

组合数学 · 数学 2020-09-17 Bence Csajbók , Giuseppe Marino , Olga Polverino

A skew Bollob\'{a}s system $\mathcal{P}=\{(A_i,B_i):1\leq i\leq m\}$ is a collection of pairs of disjoint subsets of $[n]$ such that $A_i\cap B_j\ne\emptyset$ for any $1\leq i<j\leq m$. Denote by $S_1(a, b)$ or $S_2(a, b)$ the maximum size…

组合数学 · 数学 2026-05-01 Yu Fang , Tao Feng , Xiaomiao Wang

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

计算几何 · 计算机科学 2025-04-01 Adrian Dumitrescu

Let $q=p^\alpha$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof…

组合数学 · 数学 2025-01-07 Gábor Hegedüs

Let $\mathbb{F}_p$ be the field of a prime order $p.$ It is known that for any integer $N\in [1,p]$ one can construct a subset $A\subset\mathbb{F}_p$ with $|A|= N$ such that $$ \max\{|A+A|, |AA|\}\ll p^{1/2}|A|^{1/2}. $$ In the present…

数论 · 数学 2007-06-06 M. Z. Garaev

Let $\mathbb{F}_q$ be a finite field with $q=p^n$ elements. In this paper, we study the number of $\mathbb{F}_q$-rational points on the affine hypersurface $\mathcal X$ given by $a_1 x_1^{d_1}+\dots+a_s x_s^{d_s}=b$, where…

数论 · 数学 2021-10-15 José Alves Oliveira

Let $q$ be a power of a prime number and $V$ be the $2$-dimensional column vector space over a finite field $\mathbb{F}_{q}$. Assume that $SL_2(V)<G\leq GL_2(V)$. In this paper we prove an Erd{\H{o}}s-Ko-Rado theorem for intersecting sets…

组合数学 · 数学 2022-01-05 Milad Ahanjideh

A set of $N$ points is chosen randomly in a $D$-dimensional volume $V=a^D$, with periodic boundary conditions. For each point $i$, its distance $d_i$ is found to its nearest neighbour. Then, the maximal value is found, $d_{max}=max(d_i,…

计算物理 · 物理学 2014-08-26 Malgorzata J. Krawczyk , Janusz Malinowski , Krzysztof Kulakowski

Consider a finite field $\mathbb{F}_q$ and positive integers $d,m,r$ with $1\leq r\leq \binom{m+d}{d}$. Let $S_d(m)$ be the $\mathbb{F}_q$ vector space of all homogeneous polynomials of degree $d$ in $X_0,\dots,X_m$. Let $e_r(d,m)$ be the…

代数几何 · 数学 2025-05-21 Deepesh Singhal , Yuxin Lin

For a family $\mathcal{F}$ of sets and a disjoint pair $A,B$ we let $\mathcal{F}(A,\overline{B})=\{F\in \mathcal{F}: A\subseteq F, ~B\cap F=\emptyset\}$. The \textbf{$(p,q)$-d\"omd\"od\"om} of a family $\mathcal{F}\subseteq 2^{[n]}$ is…

组合数学 · 数学 2025-01-14 Balázs Patkós

In this paper, we compute the size of the exceptional set in a generalized Goldbach problem and show that for a given polynomial $f(x) \in \mathbb{Z}[x]$ with a positive leading coefficient, positive integers $A$, $B$, $g$ and $0 \leq i, j…

数论 · 数学 2016-03-09 Dongho Byeon , Keunyoung Jeong

A $(k; r, s; n, q)$-set (short: $(r,s)$-set) of $\mathrm{PG}(n, q)$ is a set of points $X$ with $|X| = k$ such that no $s$-space contains more than $r$ points of $X$. We investigate the asymptotic size of $(r, s)$-sets for $n$ fixed and $q…

组合数学 · 数学 2022-11-14 Ferdinand Ihringer , Jacques Verstraëte

We consider a totally monotone capacity on a Polish space and a sequence of bounded p.i.i.d. random variables. We show that, on a full set, any cluster point of empirical averages lies between the lower and the upper Choquet integrals of…

概率论 · 数学 2007-05-23 Fabio Maccheroni , Massimo Marinacci

Let $\mathcal{P}(n)$ denote the power set of $[n]$, ordered by inclusion, and let $\mathcal{P}(n,p)$ be obtained from $\mathcal{P}(n)$ by selecting elements from $\mathcal{P}(n)$ independently at random with probability $p$. A classical…

组合数学 · 数学 2014-10-06 József Balogh , Richard Mycroft , Andrew Treglown

We investigate the maximal size of an increasing subset among points randomly sampled from certain probability densities. Kerov and Vershik's celebrated result states that the largest increasing subset among $N$ uniformly random points on…

概率论 · 数学 2024-12-19 Victor Dubach

We consider the question of determining the maximum number of $\mathbb{F}_q$-rational points that can lie on a hypersurface of a given degree in a weighted projective space over the finite field $\mathbb{F}_q$, or in other words, the…

We find the exact size of a maximal non-commuting set in unipotent uppertriangular linear group $UU_4(\mathbb{F}_q)$ in terms of a non-commuting geometric structure (Refer Definition [10]), where $\mathbb{F}_q$ is the finite field with $q$…

数论 · 数学 2017-02-08 C. P. Anil Kumar , S. K. Prajapati

We develop a powerful tool for embedding any tree poset $P$ of height $k$ in the Boolean lattice which allows us to solve several open problems in the area. We show that: * If $H$ is a family in $B_n$ with $|H|\ge (q-1+\varepsilon){n\choose…

组合数学 · 数学 2025-10-15 Tao Jiang , Sean Longbrake , Sam Spiro , Liana Yepremyan

We study sum-free sets in sparse random subsets of even order abelian groups. In particular, we determine the sharp threshold for the following property: the largest such set is contained in some maximum-size sum-free subset of the group.…

组合数学 · 数学 2015-06-03 Neal Bushaw , Maurício Collares Neto , Robert Morris , Paul Smith

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$…

组合数学 · 数学 2016-01-28 Luka Milićević