Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Hegyvári, Norbert"'
Let $E$ be a subset in $\mathbb{F}_p^2$ and $S$ be a subset in the special linear group $SL_2(\mathbb{F}_p)$ or the $1$-dimensional Heisenberg linear group $\mathbb{H}_1(\mathbb{F}_p)$. We define $S(E):= \bigcup_{\theta \in S} \theta (E)$. In this pa
Externí odkaz:
http://arxiv.org/abs/2411.05377
A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of the paper i
Externí odkaz:
http://arxiv.org/abs/2405.02269
Autor:
Hegyvári, Norbert
The well-known $|supp(f)||supp(\widehat{f}|\geq |G|$ inequality gives lower estimation of each supports. In the present paper we give upper estimation under arithmetic constrains. The main notion will be the additive energy which plays a central role
Externí odkaz:
http://arxiv.org/abs/2311.11025
Autor:
Hegyvári, Norbert
We are looking for integer sets that resemble classical Cantor set and investigate the structure of their sum sets. Especially we investigate $FS(B)$ the subset sum of sequence type $B=\{\lfloor p^n\alpha\rfloor\}^\infty_{n=0}$. When $p=2$, then we p
Externí odkaz:
http://arxiv.org/abs/2307.07237
Autor:
Hegyvári, Norbert
A given subset $A$ of natural numbers is said to be complete if every element of $\mathbb{N}$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. Interestingly if $A$
Externí odkaz:
http://arxiv.org/abs/2304.01777
Autor:
Hegyvári, Norbert
Erd\H os introduced the quantity $S=T\sum^T_{i=1}X_i$, where $X_1,\dots, X_T$ are arithmetic progressions, and cover the square numbers up to $N$. He conjectured that $S$ is close to $N$, i.e. the square numbers cannot be covered "economically" by ar
Externí odkaz:
http://arxiv.org/abs/2302.00408
Autor:
Hegyvári, Norbert
The aim of this note is two-fold. In the first part of the paper we are going to investigate an inverse problem related to additive energy. In the second, we investigate how dense a subset of a finite structure can be for a given additive energy.
Externí odkaz:
http://arxiv.org/abs/2212.07109
The original knapsack problem is well known to be NP-complete. In a multidimensional version one have to decide whether a $p\in \N^k$ is in a sumset-sum of a set $X \subseteq \N^k$ or not. In this paper we are going to investigate a communication com
Externí odkaz:
http://arxiv.org/abs/2103.08174
Autor:
Hegyvari, Norbert
The additive energy plays a central role in combinatorial number theory. We show an uncertainty inequality which indicates how the additive energy of support of a Boolean function, its degree and subcube partition are related.
Externí odkaz:
http://arxiv.org/abs/2009.10127