BUBalázs Udvari

Balázs Udvari

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Balázs Udvari has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • On the number of slim, semimodular lattices

    by Gábor Czédli, Tamás Dékány, László Ozsvárt, Nóra Szakács, Balázs Udvari

    A latticeLisslimif it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Czédli and E. T. Schmidt as the duals of the lattices consisting of the intersections of the members of two composition series in a group. Our main result determines the number of (isomorphism classes of) these lattices of a given size in a recursive way. The corresponding planar Hasse diagrams, up to similarity, are also enumerated. We prove that the number of diagrams of slim, distributive lattices of a given lengthnis thenth Catalan number. Besides lattice theory, the paper includes some combinatorial arguments on permutations and their inversions.


  • Minimum Number of Monotone Subsequences of Length 4 in Permutations

    by József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec

    We show that for every sufficiently largen, the number of monotone subsequences of length four in a permutation onnpoints is at least \begin{equation*} \binom{\lfloor{n/3}\rfloor}{4} + \binom{\lfloor{(n+1)/3}\rfloor}{4} + \binom{\lfloor{(n+2)/3}\rfloor}{4}. \end{equation*} Furthermore, we characterize all permutations on [n] that attain this lower bound. The proof uses the flag algebra framework together with some additional stability arguments. This problem is equivalent to some specific type of edge colourings of complete graphs with two colours, where the number of monochromaticK4is minimized. We show that all the extremal colourings must contain monochromaticK4only in one of the two colours. This translates back to permutations, where all the monotone subsequences of length four are all either increasing, or decreasing only.