B. Bajnok

activity

20082025

most citedAdditive Combinatorics: A Menu of Research Problems

5 citations · 21 across the 28 of their papers we have counts for

collaborators

Showing 2015 · math.COShow all

4 papers · 2 filters

math.CO2015

Spherical Designs and Generalized Sum-Free Sets in Abelian Groups

Béla Bajnok

We extend the concepts of sum-free sets and Sidon-sets of combinatorial number theory with the aim to provide explicit constructions for spherical designs. We call a subset $S$ of…

math.CO2015★ 1 cited

On Euclidean $t$ -designs

Béla Bajnok

A Euclidean $t$ -design, as introduced by Neumaier and Seidel (1988), is a finite set $X \subset R^{n}$ with a weight function $w : X \to R^{+}$ f…

math.CO2015★ 4 cited

On the Minimum Width of a Cutset in the Truncated Boolean Lattice

Béla Bajnok

For integers $0 \leq m \leq l \leq n - m$ , the truncated Boolean lattice $B_{n} (m, l)$ is the poset of all subsets of $[n] = {1, 2, \dots, n}$ which have size at least $m$ and…

math.CO2015

On Uniform f-vectors of Cutsets in the Truncated Boolean Lattice

Béla Bajnok, Shahriar Shahriari

Let $[n] = {1, 2, \dots, n}$ and let $2^{[n]}$ be the collection of all subsets of $[n]$ ordered by inclusion. $C \subseteq 2^{[n]}$ is a {\em cutset} if it meets every m…

Spherical Designs and Generalized Sum-Free Sets in Abelian Groups

On Euclidean t-designs

On the Minimum Width of a Cutset in the Truncated Boolean Lattice

On Uniform f-vectors of Cutsets in the Truncated Boolean Lattice

On Euclidean $t$ -designs