中文
相关论文

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

200 篇论文

We look for a non-zero $(0, 1)$-vector in the row space of the adjacency matrix $A(\Gamma)$ of a graph $\Gamma,$ provided $\Gamma$ has at least one edge. Akbari, Cameron, and Khosrovshahi conjectured that there exists a non-zero…

组合数学 · 数学 2025-02-26 Sudip Bera

A. Sannami constructed an example of the differentiable Cantor set embedded in the real line whose difference set has a positive measure. In this paper, we generalize the definition of the difference sets for sets of the two dimensional…

动力系统 · 数学 2020-04-10 Hiromichi Nakayama , Takuya Takahashi

A complete answer to the question about subspaces generated by $\{\pm 1\}$-vectors, which arose in the work of I.Kanter and H.Sompolinsky on associative memories, is given. More precisely, let vectors $v_1, \ldots , v_p,$ $p\leq n-1,$ be…

组合数学 · 数学 2024-05-09 Anwar A. Irmatov

Secant defectivity of projective varieties is classically approached via dimensions of linear systems with multiple base points in general position. The latter can be studied via degenerations. We exploit a technique that allows some of the…

代数几何 · 数学 2023-05-29 Francesco Galuppi , Alessandro Oneto

Given a matrix $A \in \mathbb{R}^{m \times n}$ ($n$ vectors in $m$ dimensions), and a positive integer $k < n$, we consider the problem of selecting $k$ column vectors from $A$ such that the volume of the parallelepiped they define is…

计算复杂性 · 计算机科学 2011-10-13 Ali Civril , Malik Magdon-Ismail

We construct a positive measure on the space of positively oriented $2$-vectors in $\mathbb{R}^4$, whose barycenter is a simple $2$-vector, yet which cannot be approximated by weighted Gaussian images of Lipschitz $Q$-graphs for any fixed…

偏微分方程分析 · 数学 2025-10-29 Daniele De Gennaro , Antonio De Rosa

The aim of this paper is to establish weighted Hardy type inequality in a broad family of means. In other words, for a fixed vector of weights $(\lambda_n)_{n=1}^\infty$ and a weighted mean $\mathscr{M}$, we search for the smallest number…

经典分析与常微分方程 · 数学 2020-12-07 Zsolt Páles , Paweł Pasteczka

We give a simplified exposition of the easiest case of a breakthrough result by D.Badziahin, A.Pollington and S.Velani related to W.M.Schmidt's conjecture.

数论 · 数学 2010-04-27 Nikolay G. Moshchevitin

Let $v$ be an odd real polynomial (i.e. a polynomial of the form $\sum_{j=1}^\ell a_jx^{2j-1}$). We utilize sets of iterated differences to establish new results about sets of the form $\mathcal…

组合数学 · 数学 2024-01-09 Vitaly Bergelson , Rigoberto Zelada

For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…

组合数学 · 数学 2022-12-20 Adrian Dumitrescu , Csaba D. Tóth

We present a substantially more efficient variant, both in terms of running time and size of preprocessing advice, of the algorithm by Liu, Lyubashevsky, and Micciancio for solving CVPP (the preprocessing version of the Closest Vector…

数据结构与算法 · 计算机科学 2019-01-28 Daniel Dadush , Oded Regev , Noah Stephens-Davidowitz

We study the structure of the zeros of optimal polynomial approximants to reciprocals of functions in Hilbert spaces of analytic functions in the unit disk. In many instances, we find the minimum possible modulus of occurring zeros via a…

经典分析与常微分方程 · 数学 2019-09-19 Catherine Bénéteau , Dmitry Khavinson , Constanze Liaw , Daniel Seco , Brian Simanek

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

数论 · 数学 2010-02-18 Mohamed El Bachraoui

For a given $1$-Lipschitz map $u\colon\mathbb{R}^n\to\mathbb{R}^m$ we define a partition, up to a set of Lebesgue measure zero, of $\mathbb{R}^n$ into maximal closed convex sets such that restriction of $u$ is an isometry on these sets. We…

度量几何 · 数学 2020-01-31 Krzysztof J. Ciosmak

In this paper we consider the problem of finding a vector that can be written as a nonnegative integer linear combination of given 0-1 vectors, the generators, such that the l_1-distance between this vector and a given target vector is…

离散数学 · 计算机科学 2010-03-12 Celine Engelbeen , Samuel Fiorini , Antje Kiesel

The study deals with a minimal energy problem in the presence of an external field over noncompact classes of vector measures of infinite dimension in a locally compact space. The components are positive measures (charges) satisfying…

经典分析与常微分方程 · 数学 2009-11-05 Natalia Zorii

We introduce a new generalization of relative entropy to non-negative vectors with sums $\gt 1$. We show in a purely combinatorial setting, with no probabilistic considerations, that in the presence of linear constraints defining a convex…

信息论 · 计算机科学 2024-05-08 Kostas N. Oikonomou

Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…

泛函分析 · 数学 2016-10-26 Tomasz Kania , Tomasz Kochanek

We show that for any sufficiently large integer $Q$ and a real $0\leq\lambda\leq\frac34$ there exists a value $c(n,f,J)>0$ such that all strips $L(Q,\lambda)=\{(x,y):|y-f(x)|<Q^{-\lambda}, x\in J=[a,b]\}$ contain at least $c(n, f,…

数论 · 数学 2017-11-30 V. Bernik , F. Götze , A. Gusakova

This paper derives central limit and bootstrap theorems for probabilities that sums of centered high-dimensional random vectors hit hyperrectangles and sparsely convex sets. Specifically, we derive Gaussian and bootstrap approximations for…

统计理论 · 数学 2016-03-09 Victor Chernozhukov , Denis Chetverikov , Kengo Kato