Related papers: Maximal Sidon Sets and Matroids
We give a simple example of an $n$-tuple of orthonormal elements in $L_2$ (actually martingale differences) bounded by a fixed constant, and hence subgaussian with a fixed constant but that are Sidon only with constant $\approx \sqrt n$.…
We solve an elementary extremal problem on trigonometric polynomials and obtain the exact value of the Sidon constant for sets with three elements {n0, n1, n2}: it is \sec(\pi / 2n) for n = max(n1-n0, n2-n0, n2-n1) / gcd(n1-n0, n2-n0).
Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$…
We prove that the tail of the sets $$\mathbf S_x := \big\{\left\lfloor x^n\right\rfloor : n\in \mathbb N\big\}$$ are Sidon for almost all $x\in (1,2)$. Then we prove that for all $\varepsilon>0$, there exists $x\in (1,\, 1+\varepsilon)$ and…
Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…
Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…
For the finite ordered sets $A, D$, write $A^D$ for the ordered set of isotone maps $D \to A$ with the pointwise order. It was proved in earlier work that the order structure of $A^A$ determines~$A$ up to isomorphism. In this note we extend…
Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…
Let $G$ be a finite group. A sequence over $G$ means a finite sequence of terms from $G$, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can be ordered such that their product…
In his seminal work on Sidon sets, Pisier found an important characterization of Sidonicity: A set is Sidon if and only if it is proportionally quasi-independent. Later, it was shown that Sidon sets were proportionally `special' Sidon in…
We obtain a new lower bound on the largest Sidon subset of an arbitrary finite set of integers. If $H(n)$ denotes the minimum, over all $n$-element subsets of $\mathbb Z$, of the largest Sidon subset they contain, we prove that $H(n)…
Let $F_p$ be the field of a prime order $p.$ For a subset $A\subset F_p$ we consider the product set $A(A+1).$ This set is an image of $A\times A$ under the polynomial mapping $f(x,y)=xy+x:F_p\times F_p\to F_p.$ In the present paper we show…
We give some necessary conditions for maximality of $0/1$-determinant. Let ${\bf M}$ be a nondegenerate $0/1$-matrix of order $n$. Denote by $\bf A$ the matrix of order $n+1$ which appears from ${\bf M}$ after adding the $(n+1)$th row…
A subset $X$ of an Abelian group $G$ is called $semiaf\!fine$ if for every $x,y,z\in X$ the set $\{x+y-z,x-y+z\}$ intersects $X$. We prove that a subset $X$ of an Abelian group $G$ is semiaffine if and only if one of the following…
Let $k$ be a number field and $B$ be a central simple algebra over $k$ of dimension $p^2$ where $p$ is prime. In the case that $p=2$ we assume that $B$ is not totally definite. In this paper we study sets of pairwise nonisomorphic maximal…
A matroid M is cyclically orderable if there is a cyclic permutation of the elements of M such that any r consecutive elements form a basis in M. An old conjecture of Kajitani, Miyano, and Ueno states that a matroid M is cyclically…
For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…
For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…
The vertex-deleted subgraph G-v, obtained from the graph G by deleting the vertex v and all edges incident to v, is called a card of G. The deck of G is the multiset of its unlabelled cards. The number of common cards b(G,H) of G and H is…
The following is true in the Solovay model. 1. If $\leq$ is a Borel partial quasi-order on a Borel set $D$ of the reals, $X$ is a ROD subset of $D$, and $\leq$ restricted to $X$ is linear, then $X$ is countably cofinal in the sense of…