中文
相关论文

相关论文: A Frostman type lemma for sets with large intersec…

200 篇论文

We generalize Gaeta's Theorem to the family of determinantal schemes. In other words, we show that the schemes defined by minors of a fixed size of a matrix with polynomial entries belong to the same G-biliaison class of a complete…

代数几何 · 数学 2014-01-14 Elisa Gorla

We advertise elementary symmetric polynomials $e_i$ as the natural basis for generating series $A_{g,n}$ of intersection numbers of genus g and n marked points. Closed formulae for $A_{g,n}$ are known for genera $0$ and $1$ -- this approach…

代数几何 · 数学 2024-01-01 Bertrand Eynard , Danilo Lewański

A family of permutations A \subset S_n is said to be intersecting if any two permutations in A agree at some point, i.e. for any \sigma, \pi \in A, there is some i such that \sigma(i)=\pi(i). Deza and Frankl showed that for such a family,…

组合数学 · 数学 2014-02-26 David Ellis

In this paper we prove quantitative results about geodesic approximations to submanifolds in negatively curved spaces. Among the main tools is a new and general Jarn\'{i}k-Besicovitch type theorem in Diophantine approximation. The framework…

度量几何 · 数学 2024-02-21 Anish Ghosh , Debanjan Nandi

Let $E=\limsup\limits_{n\to\infty}(g_n+\xi_n)$ be the random covering set on the torus $\mathbb{T}^d$, where $\{g_n\}$ is a sequence of ball-like sets and $\xi_n$ is a sequence of independent random variables uniformly distributed on…

经典分析与常微分方程 · 数学 2013-07-18 Bing Li , Ville Suomala

A classical result of Kaufman states that, for each $\tau>1,$ the set of well approximable numbers \[ E(\tau)=\{x\in\mathbb{R}: \|qx\| < |q|^{-\tau} \text{ for infinitely many integers q}\} \] is a Salem set with Hausdorff dimension…

数论 · 数学 2021-09-24 Kyle Hambrook , Han Yu

This paper extends some results of [M5] and [M3], in particular, removing assumptions of positive lower density. We give conditions on a general family $P_{\lambda}:\mathbb{R}^{n}\to\mathbb{R}^{m}, \lambda \in \Lambda,$ of orthogonal…

经典分析与常微分方程 · 数学 2023-10-12 Pertti Mattila

We draw connections between the various conjectures which are included in G. R\'emond's generalized Lehmer problems. Specifically, we show that the degree one form of his conjecture for the multiplicative group is, in a sense, almost as…

数论 · 数学 2017-11-03 Robert Grizzard

We study problems on covering $[0,1)$ by shrinking intervals centered at the points $\{q_n x\}$, where $(q_n)_{n\in \mathbb{N}}$ is a given real-valued sequence and $x \in [0,1)$ is random. For real-valued lacunary sequences…

A family $F$ of graphs on a fixed set of $n$ vertices is called triangle-intersecting if for any $G_1,G_2 \in F$, the intersection $G_1 \cap G_2$ contains a triangle. More generally, for a fixed graph $H$, a family $F$ is $H$-intersecting…

组合数学 · 数学 2018-10-15 Nathan Keller , Noam Lifshitz

Inspired by the classic problem of Boolean function monotonicity testing, we investigate the testability of other well-studied properties of combinatorial finite set systems, specifically \emph{intersecting} families and \emph{union-closed}…

计算复杂性 · 计算机科学 2023-11-21 Xi Chen , Anindya De , Yuhao Li , Shivam Nadimpalli , Rocco A. Servedio

A family X of sets is said to be intersecting if any two members of X have non-empty intersection. It is a well-known and simple fact that an intersecting family of subsets of [n]={1,2,...,n} can contain at most 2^(n-1) sets. Katona, Katona…

组合数学 · 数学 2011-08-17 Paul A. Russell

We investigate the sufficient conditions for boundedness of one type of difference equations of the form $x(n+1)=ax(n)+f(x(n)) + y(n), \ n\geq 1$ in critical case $|a|=1$. For this equation the following assumptions are introduced: 1) The…

动力系统 · 数学 2025-09-16 Andrii Chaikovskyi , Oleksandr Liubimov

A group homomorphism eta:H-->G is called a localization of H if every homomorphism phi:H-->G can be `extended uniquely' to a homomorphism Phi:G-->G in the sense that Phi eta=phi. Libman showed that a localization of a finite group need not…

逻辑 · 数学 2007-05-23 Ruediger Goebel , Jose L. Rodriguez , Saharon Shelah

We give a new proof of the Frankl-R\"odl theorem on forbidden intersections, via the probabilistic method of dependent random choice. Our method extends to codes with forbidden distances, where over large alphabets our bound is…

组合数学 · 数学 2014-02-26 Peter Keevash , Eoin Long

The aim of this paper is to give fine asymptotics for random variables with moments of Gamma type. Among the examples we consider are random determinants of Laguerre and Jacobi beta ensembles with varying dimensions (the number of observed…

概率论 · 数学 2017-10-19 Peter Eichelsbacher , Lukas Knichel

We say that a set $A$ \emph{$t$-intersects} a set $B$ if $A$ and $B$ have at least $t$ common elements. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be \emph{cross-$t$-intersecting} if each set in $\mathcal{A}$ $t$-intersects…

组合数学 · 数学 2013-12-12 Peter Borg

We study the distribution of sequences of the form $(q_ny)_{n=1}^\infty$, where $(q_n)_{n=1}^\infty$ is some increasing sequence of integers. In particular, we study the Lebesgue measure and find bounds on the Hausdorff dimension of the set…

数论 · 数学 2024-11-20 S. Kristensen , T. Persson

We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…

组合数学 · 数学 2012-05-22 Liviu Ilinca , Jeff Kahn

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

形式语言与自动机理论 · 计算机科学 2018-06-14 Lukas Fleischer