11 citations · 12 across the 8 of their papers we have counts for
9 papers
Reflections on future problems in cluster science
K. Hansen, V. V. Kresin, R. Alhyder +22
This article is a collection of contributions from speakers at the 2025 DEAMN [Dynamics of Electrons in Atomic and Molecular Nanoclusters] workshop at the Majorana Centre in Erice.…
Generic symmetry defect set of an algebraic curve
L. R. G. Dias, M. Farnik, Z. Jelonek
Let be an -dimensional algebraic variety. We define the algebraic version of the generic symmetry defect set (Wigner caustic) of . Moreover, we co…
On stable polynomial mappings
Michał Farnik, Zbigniew Jelonek
For given natural numbers let be the set off all polynomial mappings such that deg , deg . We say…
Hat chromatic number of graphs
Bartłomiej Bosek, Andrzej Dudek, Michał Farnik +2
We study the hat chromatic number of a graph defined in the following way: there is one player at each vertex of a loopless graph , an adversary places a hat of one of color…
Ionization of Ammonia Nanoices With Adsorbed Methanol Molecules
Michal Fárník, Andriy Pysanenko, Kamila Moriová +4
Large ammonia clusters represent a model system of ices which are omnipresent throughout the space. The interaction of ammonia ices with other hydrogen-boding molecules such as met…
On quadratic polynomial mappings from the plane into the dimensional space
Michał Farnik, Zbigniew Jelonek, Piotr Migus
We show that, up to linear equivalence, there are only finitely many polynomial quadratic mappings and . We list all…
On quadratic polynomial mappings
M. Farnik, Z. Jelonek
We show that up to linear equivalence, there is only finitely many polynomial quadratic mappings and We list all possibilities.
Newton-Okounkov bodies sprouting on the valuative tree
C. Ciliberto, M. Farnik, A. Küronya +3
Given a smooth projective algebraic surface X, a point O in X and a big divisor D on X, we consider the set of all Newton-Okounkov bodies of D with respect to valuations of the fie…
Beyond the Shannon's Bound
Michał Farnik, Łukasz Kowalik, Arkadiusz Socała
Let be a multigraph of maximum degree . The edges of can be colored with at most colors by Shannon's theorem. We study lower bounds on the size of s…