中文
相关论文

相关论文: On Helly numbers of exponential lattices

200 篇论文

A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…

逻辑 · 数学 2020-10-05 Nikolay Bazhenov , Manat Mustafa

Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…

组合数学 · 数学 2024-11-26 Pavel Paták

Take ${\sf Q}=({\sf Q}_1,{\sf Q}_2,\ldots)$ to be an exponential structure and $M(n)$ to be the number of minimal elements of ${\sf Q}_n$ where $M(0)=1$. Then a sequence of numbers $\{r_n({\sf Q}_n)\}_{n\ge 1}$ is defined by the equation…

组合数学 · 数学 2015-12-11 Emma Yu Jin

In 2008, Halman proved a discrete Helly-type theorem for axis-parallel boxes in $\mathbb R^d$. Very recently, this result was extended to the $(p,q)$ setting with $p \geq q \geq d+1$ by Edwards and Sober\'on, and subsequently to the case $p…

组合数学 · 数学 2026-04-07 Wei Rao

Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$-line graph of $G$, denoted by $HL(G)$, is that graph whose vertices are the edges of $G$ and where two vertices of $HL(G)$ are adjacent if they are…

组合数学 · 数学 2022-07-29 Alvaro Carbonero

We prove the following sparse approximation result for polytopes. Assume that $Q$ is a polytope in John's position. Then there exist at most $2d$ vertices of $Q$ whose convex hull $Q'$ satisfies $Q \subseteq - 2d^2 \, Q'$. As a consequence,…

度量几何 · 数学 2022-09-13 Víctor Hugo Almendra-Hernández , Gergely Ambrus , Matthew Kendall

Let $H$ be a monoid, $\mathscr F(X)$ be the free monoid on a set $X$, and $\pi_H$ be the unique extension of the identity map on $H$ to a monoid homomorphism $\mathscr F(H) \to H$. Given $A \subseteq H$, an $A$-word $\mathfrak z$ (i.e., an…

环与代数 · 数学 2024-11-11 Laura Cossu , Salvatore Tringali

We describe a connection between the combinatorics of generators for certain groups and the combinatorics of Helly's 1913 theorem on convex sets. We use this connection to prove fixed point theorems for actions of these groups on…

群论 · 数学 2008-06-11 Benson Farb

Let $E$ be an elliptic curve over a number field $L$ and for a finite set $S$ of primes, let $\rho_{E,S} : {\rm Gal}(\overline{L}/L) \to {\rm GL}_{2}(\mathbb{Z}_{S})$ be the $S$-adic Galois representation. If $L \cap \mathbb{Q}(\zeta_{n}) =…

数论 · 数学 2024-09-10 Harris Daniels , Jeremy Rouse

Let $p_n$ denote the $n$th smallest prime number, and let $\boldsymbol{L}$ denote the set of limit points of the sequence $\{(p_{n+1} - p_n)/\log p_n\}_{n = 1}^{\infty}$ of normalized differences between consecutive primes. We show that for…

数论 · 数学 2017-05-17 William D. Banks , Tristan Freiberg , James Maynard

Kirszbraun's Theorem states that every Lipschitz map $S\to\mathbb R^n$, where $S\subseteq \mathbb R^m$, has an extension to a Lipschitz map $\mathbb R^m \to \mathbb R^n$ with the same Lipschitz constant. Its proof relies on Helly's Theorem:…

逻辑 · 数学 2014-02-26 Matthias Aschenbrenner , Andreas Fischer

An elementary set of non-Hermitian $N$ by $N$ matrices $H^{(N)}(\lambda) \neq [ H^{(N)}(\lambda)]^\dagger$ with real spectra is considered, assuming that each of these matrices represents a selfadjoint quantum Hamiltonian in an {\it ad hoc}…

数学物理 · 物理学 2008-07-29 Miloslav Znojil

Let $\mathrm{ex}(n,H,\mathcal{F})$ be the maximum number of copies of $H$ in an $n$-vertex graph which contains no copy of a graph from $\mathcal{F}$. Thinking of $H$ and $\mathcal{F}$ as fixed, we study the asymptotics of…

组合数学 · 数学 2024-09-16 Sean English , Anastasia Halfpap , Robert A. Krueger

In this paper we investigate the minimum number of maximal subgroups H_i for i=1 ...k of the symmetric group S_n (or the alternating group A_n) such that each element in the group S_n (respectively A_n) lies in some conjugate of one of the…

群论 · 数学 2010-11-22 Daniela Bubboloni , Cheryl Praeger

The author \cite{4} proved that, for every set $S$ of positive integers containing 1 (finite or infinite) there exists the density $h=h(E(S))$ of the set $E(S)$ of numbers whose prime factorizations contain exponents only from $S,$ and gave…

数论 · 数学 2016-02-16 Vladimir Shevelev

Let $\ell\geq 5$ be a prime number and $\mathbb{F}_\ell$ denote the finite field with $\ell$ elements. We show that the number of Galois extensions of the rationals with Galois group isomorphic to $GL_2(\mathbb{F}_\ell)$ and absolute…

数论 · 数学 2025-06-06 Anwesh Ray

Given simple graphs $H_{1},H_{2},\ldots,H_{c}$, the Ramsey number $r(H_{1},H_{2},\ldots,H_{c})$ is the smallest positive integer $n$ such that every edge-colored $K_{n}$ with $c$ colors contains a subgraph in color $i$ isomorphic to $H_{i}$…

组合数学 · 数学 2020-10-22 Chuandong Xu , Hongna Yang , Shenggui Zhang

We consider the problem of finding the minimum of inhomogeneous Gaussian lattice sums: Given a lattice $L \subseteq \mathbb{R}^n$ and a positive constant $\alpha$, the goal is to find the minimizers of $\sum_{x \in L} e^{-\alpha \|x -…

For each $n \geq 2$, $l \geq 3$, let ${ES}_L (l,n)$ be the minimum $N$ such that every family of $N$-lines in the plane contains either $l$ concurrent lines or $n$ lines in convex position. In this papar, we give the upper and lower bounds…

组合数学 · 数学 2024-11-20 Koki Furukawa

For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $\delta_{\mathrm{sub}}(n, H)$ be the smallest integer…

组合数学 · 数学 2025-04-30 Hyunwoo Lee