English
Related papers

Related papers: $B_h$-sets of real and complex numbers

200 papers

We completely characterize the finite dimensional subsets A of any separable Hilbert space for which the notion of A-hypercyclicity coincides with the notion of hypercyclicity, where an operator T on a topological vector space X is said to…

Functional Analysis · Mathematics 2018-08-17 S. Charpentier , R. Ernst

Let $A\subseteq \mathbb{Z}_{\geq 0}$ be a finite set with minimum element $0$, maximum element $m$, and $\ell$ elements strictly in between. Write $(hA)^{(t)}$ for the set of integers that can be written in at least $t$ ways as a sum of $h$…

Combinatorics · Mathematics 2024-12-18 Christian Táfula

Almkvist and Meurman showed that if h and k are integers, then so is $k^n(B_n(h/k) - B_n)$ where $B_n(u)$ is the Bernoulli polynomial. We give here a new and simpler proof of the Almkvist-Meurman theorem using generating functions. We…

Number Theory · Mathematics 2023-03-20 Ira M. Gessel

General properties of ternary semigroups and groups are considered. The bi-element representation theory in which every representation matrix corresponds to a pair of elements is built, connection with the standard theory is considered and…

Group Theory · Mathematics 2007-05-23 Andrzej Borowiec , Wieslaw A. Dudek , Steven Duplij

Let $CLB_H(X)$ denote the hyperspace of closed bounded subsets of a metric space $X$, endowed with the Hausdorff metric topology. We prove, among others, that natural dense subspaces of $CLB_H(R^m)$ of all nowhere dense closed sets, of all…

General Topology · Mathematics 2012-10-23 Wieslaw Kubis , Katsuro Sakai

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

Logic · Mathematics 2008-03-25 Wesley Calvert , Valentina S. Harizanov , Julia F. Knight , Sara Miller

Let $K$ be an algebrically closed field and let $n\geq 1$. If $P\in K[X]=K[X_1,\ldots,X_n]$, $P\neq 0$, we denote by $I(P)$ the support of $P$, which is the finite subset of $\mathbb N^n$ such that $P=\sum_{i\in I(P)}a_iX^i$ with $a_i\in…

Commutative Algebra · Mathematics 2010-08-31 Constantin-Nicolae Beli

A subset $R$ of integers is a set of Bohr recurrence if every rotation on $\mathbb{T}^d$ returns arbitrarily close to zero under some non-zero multiple of $R$. We show that the set $\{k!\, 2^m3^n\colon k,m,n\in \mathbb{N}\}$ is a set of…

Dynamical Systems · Mathematics 2024-11-05 Nikos Frantzikinakis , Bernard Host , Bryna Kra

A subset $X$ of an abelian $G$ is said to be {\em complete} if every element of the subgroup generated by $X$ can be expressed as a nonempty sum of distinct elements from $X$. Let $A\subset \Z_n$ be such that all the elements of $A$ are…

Number Theory · Mathematics 2007-05-23 Y. O. Hamidoune , A. S. Lladó , O. Serra

A set of vertices in a graph is a Hamiltonian subset if it induces a subgraph containing a Hamiltonian cycle. Kim, Liu, Sharifzadeh and Staden proved that among all graphs with minimum degree $d$, $K_{d+1}$ minimises the number of…

Combinatorics · Mathematics 2023-01-19 Stijn Cambie , Jun Gao , Hong Liu

In this paper, we decompose the set of fully commutative elements into natural subsets when the Coxeter group is of type $D_n$, and study the combinatorics of these subsets, revealing hidden structures. (We do not consider type $A_n$ first,…

Representation Theory · Mathematics 2015-07-30 Gabriel Feinberg , Kyu-Hwan Lee

Given a (not necessarily continuous) homomorphism between Banach algebras $\T\colon\A\to\B$, an element $a\in\A$ will be said to be B-Fredholm (respectively generalized B-Fredholm) relative to $\T$, if $\T(a)\in \B$ is Drazin invertible…

Functional Analysis · Mathematics 2015-04-14 Milos D. Cvetkovic , Enrico Boasso , Snezana C. Zivkovic-Zlatanovic

In a simple drawing of a graph every pair of edges intersect each other in at most one point, which is either a common endvertex or a proper crossing. For each positive integer $n$, Negami identified a drawing $B_n$ of the complete…

Combinatorics · Mathematics 2025-09-26 Jozsef Balogh , Irene Parada , Gelasio Salazar

We say that a set system $\mathcal{F}$ is $k$-completely hyperseparating if for any vertex $v$, there are at most $k$ sets in $\mathcal{F}$ with intersection $\{v\}$. We determine the minimum size of such set systems on an $n$-element…

Combinatorics · Mathematics 2026-03-10 Dániel Gerbner

For any set $A$ of natural numbers with positive upper Banach density, we show the existence of an infinite set $B$ and sequences $(t_k)_{k\in \mathbb{N}}, (s_k)_{k\in \mathbb{N}}$ of natural numbers such that $\left\{ \sum_{n \in F}n : F…

Dynamical Systems · Mathematics 2025-10-22 Felipe Hernández , Ioannis Kousek , Tristán Radić

An n-element set contains an unknown number of excellent elements, and our goal is to identify at least one of these elements. The members of a family of subsets can be asked if they contain at least one excellent element or not. At most…

Combinatorics · Mathematics 2025-07-21 Aanchal Gupta , Gyula O. H. Katona

To study any dynamical system it is useful to find a partition that allows essentially faithful encoding (injective, up to a small exceptional set) into a subshift. Most topological and measure-theoretic systems can be represented by…

Dynamical Systems · Mathematics 2024-09-04 Sarah Frick , Karl Petersen , Sandi Shields

Let ${\Bbb F}_2$ be the finite field of two elements, ${\Bbb F}_2^n$ be the vector space of dimension $n$ over ${\Bbb F}_2$. For sets $A,\,B\subseteq{\Bbb F}_2^n$, their sumset is defined as the set of all pairwise sums $a+b$ with $a\in…

Number Theory · Mathematics 2012-05-29 Chaohua Jia

We give a combinatorial formula for the Ehrhart $h^*$-vector of the hypersimplex. In particular, we show that $h^{*}_{d}(\Delta_{k,n})$ is the number of hypersimplicial decorated ordered set partitions of type $(k,n)$ with winding number…

Combinatorics · Mathematics 2020-01-28 Donghyun Kim

We prove that for all positive integers $n$ and $k$, there exists an integer $N = N(n,k)$ satisfying the following. If $U$ is a set of $k$ direction vectors in the plane and $\mathcal{J}_U$ is the set of all line segments in direction $u$…

Combinatorics · Mathematics 2021-01-11 Jinha Kim , Minki Kim , O-Joung Kwon