相关论文: On random sections of the cube

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

This paper consists of two independent, but related parts. In the first part we show how to use symbolic computation to derive explicit expressions for the first few moments of the number of implicants that a random Boolean function has, or…

Let $A$ be an $n$ by $N$ real valued random matrix, and $\h$ denote the $N$-dimensional hypercube. For numerous random matrix ensembles, the expected number of $k$-dimensional faces of the random $n$-dimensional zonotope $A\h$ obeys the…

We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…

We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of…

In this paper, we investigate $\pi(m,n)$, the number of partitions of the \emph{bipartite number} $(m,n)$ into \emph{steadily decreasing} parts, introduced by L.Carlitz ['A problem in partitions', Duke Math Journal 30 (1963), 203--213]. We…

We study the properties of the maximal volume $k$-dimensional sections of the $n$-dimensional cube $[-1,1]^n$. We obtain a first order necessary condition for a $k$-dimensional subspace to be a local maximizer of the volume of such…

In "Random complex fewnomials, I," B. Shiffman and S. Zelditch determine the limiting formula as N goes to infinity of the (normalized) expected distribution of complex zeros of a system of k random n-nomials in m variables where the…

An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…

We show that there is a constant $K > 0$ such that for all $N, s \in \N$, $s \le N$, the point set consisting of $N$ points chosen uniformly at random in the $s$-dimensional unit cube $[0,1]^s$ with probability at least $1-\exp(-\Theta(s))$…

Suppose that i.i.d. random variables $X_{1}, X_{2}, \ldots$ are chosen uniformly from $[0,1]$, and let $f: [0,1] \rightarrow [0,1]$ be an increasing bijection. Define $\mu_{f}$ to be the expected value of $f(X_{i})$ for each $i$. Define the…

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

Let $k\ge 2$ be a fixed integer. We consider sums of type $\sum_{n_1^2+\cdots+ n_k^2\le x} F(n_1,\ldots,n_k)$, taken over the $k$-dimensional spherical region $\{(n_1,\ldots,n_k)\in {\Bbb Z}^k: n_1^2+\cdots+ n_k^2\le x\}$, where $F:{\Bbb…

Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…

The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…

We fix a maximal order $\mathcal O$ in $\F=\R,\C$ or $\mathbb{H}$, and an $\F$-hermitian form $Q$ of signature $(n,1)$ with coefficients in $\mathcal O$. Let $k\in\N$. By applying a lattice point theorem on the $\F$-hyperbolic space, we…

In this paper, we proved that there are infinite cube--free numbers of the form $[n^c]$ for any fixed real number $1<c<11/6$.

Letting $p$ vary over all primes and $E$ vary over all elliptic curves over the finite field $\mathbb{F}_p$, we study the frequency to which a given group $G$ arises as a group of points $E(\mathbb{F}_p)$. It is well-known that the only…

Let f(m,n) denote the number of relatively prime subsets of {m+1,m+2,...,n}, and let Phi(m,n) denote the number of subsets A of {m+1,m+2,...,n} such that gcd(A) is relatively prime to n. Let f_k(m,n) and Phi_k(m,n) be the analogous counting…

For every even positive integer $k\ge 4$ let $f(n,k)$ denote the minimim number of colors required to color the edges of the $n$-dimensional cube $Q_n$, so that the edges of every copy of $k$-cycle $C_k$ receive $k$ distinct colors.…