BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Norbert Hegyvari (Eotvos Lorand University and   Alfred Renyi Inst
 itute of Mathematics\, Hungary)
DTSTART:20220526T140000Z
DTEND:20220526T142500Z
DTSTAMP:20260423T011341Z
UID:CANT2022/33
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2022/33/
 ">Boolean functions defined on pseudo-recursive sequences</a>\nby Norbert 
 Hegyvari (Eotvos Lorand University and   Alfred Renyi Institute of Mathema
 tics\, Hungary) as part of Combinatorial and additive number theory (CANT 
 2022)\n\n\nAbstract\nWe define Boolean functions on hypergraphs with edges
  having big intersections\, and an opposite situation\, \nhypergraphs whic
 h are thinly intersective induced by pseudo-recursive sequences. As a main
  result\, we estimate the cardinality of their supports.\nA sequence $X$ i
 s said to be pseudo-recursive (or pesudo-linear) sequence if the identity\
 n$x_{n+1}=M\\cdot x_n+ b_{j_{n+1}}$ holds\, where $ b_{j_{n+1}}\\in \\{b_1
 \,b_2\, \\dots b_k\\}$) for $n \\geq 0$ and $M$ is a positive integer. (Th
 is type of sequences have a long list in the combinatorial number theory a
 nd other areas too\, e.g. in random walk theory). \n\n The tools come from
  additive combinatorics and the uncertainty inequality.\n
LOCATION:https://researchseminars.org/talk/CANT2022/33/
END:VEVENT
END:VCALENDAR