Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0707.4436

An application of linear programming duality to discrete Fourier analysis and additive problems

Ernie Croot
View original source ↗Read source document ↗Export metadata ↓

Abstract

Suppose that f is a function from Z_p -> [0,1] (Z_p is my notation for the integers mod p, not the p-adics), and suppose that a_1,...,a_k are some places in Z_p. In some additive number theory applications it would be nice to perturb f slightly so that Fourier transform f^ vanishes at a_1,...,a_k, while additive properties are left intact. In the present paper, we show that even if we are unsuccessful in this, we can at least say something interesting by using the principle of the separating hyperplane, a basic ingredient in linear programming duality.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ernie Croot. 2007-07-30. An application of linear programming duality to discrete Fourier analysis and additive problems. https://arxiv.org/abs/0707.4436

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The gold partition conjecture and the Lexicographic sum of posets

We prove that if a finite poset $Q$ satisfies the Gold Partition Conjecture, and $P$ is a finite poset, then for any $i\in P$ the lexicographic sum $P\circ_iQ$ of $P$ with $Q$ on the point $i$, satisfies the Gold Partition Conjecture. Let $L(P)$ be the set of linearizations of $P$, $e(P)=\#L(P)$, $ \mathbb{P}(x<y)=\frac{\#\{f\in L(P)|x<_f y\}|}{e(P)}$, and $δ(P)=\max_{x,y\in P}\min\{\mathbb{P}(x<y),$ $\mathbb{P}(y<x)\}$. We describe the behavior of those numbers when $P$ is a lexicographic sum. Namely, $\prod_{i=1}^n e(Q_i)\,$ divides $\,e(P( Q_1,\dots,Q_{|P|}))$, and $δ(P(Q_1,\dots,Q_n))\geq \max_{1\leq i\leq n}\{ δ(Q_i)\}$.

math.CO↗
arXiv2026

Hall--Littlewood expansions of chromatic quasisymmetric functions using linked rook placements

In this work, we obtain a Hall--Littlewood expansion of the chromatic quasisymmetric function arising from a natural unit interval order and describe the coefficients in terms of linked rook placements. Applying the Carlsson--Mellit relation between chromatic quasisymmetric functions and unicellular LLT polynomials, we also obtain a combinatorial description for the coefficients of the unicellular LLT polynomials expanded in terms of the modified transformed Hall--Littlewood polynomials.

math.CO↗
arXiv2026

The Homomorphism Submodule Graph

Let $M$ be a left $R$-module. We define the \emph{homomorphism submodule graph} $Γ_{\mathrm{Hom}}(M)$ as the simple graph whose vertices are the proper submodules of $M$, with an edge between distinct vertices $N_1$ and $N_2$ if and only if $\mathrm{Hom}_R(N_1, M/N_2) \ne 0$ or $\mathrm{Hom}_R(N_2, M/N_1) \ne 0$. This graph encodes homological information about $M$ and reflects its internal structure. We compute $Γ_{\mathrm{Hom}}(M)$ for semisimple and uniserial modules, establish precise correspondences between graph-theoretic and algebraic properties, and prove that for modules over Artinian local rings, the isomorphism type of $M$ is determined by $Γ_{\mathrm{Hom}}(M)$. We also show that over commutative rings with identity, the graph is always chordal, and we relate its spectral radius to composition length in natural families.

math.CO↗