Balázs Udvari
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Balázs Udvari has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Bernard Lidický
Department of Mathematics Iowa State University Ames Iowa USA
1 shared publication - Gábor Czédli
University of Szeged
1 shared publication - Jan Volec
Department of Mathematics Faculty of Nuclear Sciences and Physical Engineering Czech Technical University in Prague Trojanova 13 120 00 Prague Czech Republic
1 shared publication - József Balogh
Department of Mathematical Sciences University of Illinois at Urbana-Champaign 61801 Urbana Illinois USA
1 shared publication - László Ozsvárt
Bolyai Institute University of Szeged Aradi Vértanúk tere 1 6720 Szeged Hungary
1 shared publication - Nóra Szakács
Bolyai Institute, University of Szeged, Szeged, Hungary
1 shared publication
Latest Publications
- 1 February 2016
- Published by Walter de Gruyter GmbH in Mathematica Slovaca
- Vol. 66 (1) , 5-18
On the number of slim, semimodular lattices
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.
- 1 February 2016
- Published by Walter de Gruyter GmbH in Mathematica Slovaca
- Vol. 66 (1) , 5-18
On the number of slim, semimodular lattices
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.
- 19 December 2014
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 24 (4) , 658-679
Minimum Number of Monotone Subsequences of Length 4 in Permutations
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.- 19 December 2014
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 24 (4) , 658-679
Minimum Number of Monotone Subsequences of Length 4 in Permutations
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.