相关论文: Badly approximable vectors on a vertical Cantor se…

We compute the Hausdorff dimension of the set of $\psi$-exactly approximable vectors, in the simultaneous case, in dimension strictly larger than $2$ and for approximating functions $\psi$ with order at infinity less than or equal to $-2$.…

For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For…

We establish various new results on a problem proposed by K. Mahler in 1984 concerning rational approximation to fractal sets by rational numbers inside and outside the set in question, respectively. Some of them provide a natural…

A well-known result of Bollob\'as says that if $\{(A_i, B_i)\}_{i=1}^m$ is a set pair system such that $|A_i| \le a$ and $|B_i| \le b$ for $1 \le i \le m$, and $A_i \cap B_j \ne \emptyset$ if and only if $i \ne j$, then $m \le {a+b \choose…

Let $n$ and $r$ be two integers such that $0 < r \le n$; we denote by $\gamma(n,r)$ [$\eta(n,r)$] the minimum [maximum] number of the non-negative partial sums of a sum $\sum_{1=1}^n a_i \ge 0$, where $a_1, \cdots, a_n$ are $n$ real numbers…

In this paper, we provide a new scheme for approximating the weakly efficient solution set for a class of vector optimization problems with rational objectives over a feasible set defined by finitely many polynomial inequalities. More…

In this paper we resolve the Alon-Jaeger-Tarsi conjecture for sufficiently large primes. Namely, we show that for any finite field $\mathbb{F}$ of size $61<|\mathbb F|\ne 79$ and any nonsingular matrix $M$ over $\mathbb{F}$ there exists a…

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

We shall study three subjects of the Jacobi-Perron Algorithm of dimension 2. First, we study the "ideal convergence". About the approximations (p_n/r_n, q_n/r_n) to (A, B) (where A and B are positive real numbers, r_n, p_n and q_n are…

Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum of the component-wise maxima of the four vectors in the…

We introduce the notion of r-defectivity for a vector bundle on a quasi-projective variety. Using this tool, we prove several previously unknown cases of Fr\"oberg's conjecture and also of the postulation problem for fat point schemes. Our…

For given $\epsilon>0$ and $b\in\mathbb{R}^m$, we say that a real $m\times n$ matrix $A$ is $\epsilon$-badly approximable for the target $b$ if $$\liminf_{q\in\mathbb{Z}^n, \|q\|\to\infty} \|q\|^n \langle Aq-b \rangle^m \geq \epsilon,$$…

Recently Koivusalo, Levesley, Ward and Zhang introduced the set of simultaneously $\Phi$-badly approximable real vectors of $\mathbb{R}^m$ with respect to an approximation function $\Phi$, and determined its Hausdorff dimension for the…

We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…

We are interested in local quasi efficient solutions for nonsmooth vector optimization problems under new generalized approximate invexity assumptions. We formulate necessary and sufficient optimality conditions based on Stampacchia and…

Constant weight codes (CWCs) and constant composition codes (CCCs) are two important classes of codes that have been studied extensively in both combinatorics and coding theory for nearly sixty years. In this paper we show that for {\it…

This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…

In 1988, Bj\"{o}rner and Kalai used combinatorial shadow functions to characterize the maximal Betti sequence for a given $f$-vector and the minimal $f$-vector for a given Betti sequence. Their description of the maximal Betti sequence was…

In this paper we resolve a conjecture of Kresch and Tamvakis. Our result is the following. Theorem: For any positive integer $D$ and any integers $i,j$ $(0\leq i,j \leq D)$, the absolute value of the following hypergeometric series is at…