activity
20152024
most citedShadowing, asymptotic shadowing and s-limit shadowing

19 citations · 48 across the 12 of their papers we have counts for

collaborators

12 papers

math.CO2024

Predators and altruists arriving on jammed Riviera

Tomislav Došlić, Mate Puljiz, Stjepan Šebek +1

The Riviera model is a combinatorial model for a settlement along a coastline, introduced recently by the authors. Of most interest are the so-called jammed states, where no more h…

cond-mat.stat-mech2023

A model of random sequential adsorption on a ladder graph

Tomislav Došlić, Mate Puljiz, Stjepan Šebek +1

In random sequential adsorption (RSA), objects are deposited on a substrate randomly, irreversibly, and sequentially. Attempts of deposition that lead to an overlap with previously…

cs.LG2023★ 2 cited

Out-of-Distribution Detection by Leveraging Between-Layer Transformation Smoothness

Fran Jelenić, Josip Jukić, Martin Tutek +2

Effective out-of-distribution (OOD) detection is crucial for reliable machine learning models, yet most current methods are limited in practical use due to requirements like access…

math.CO2023

Complexity Function of Jammed Configurations of Rydberg Atoms

Tomislav Došlić, Mate Puljiz, Stjepan Šebek +1

In this article, we determine the complexity function (configurational entropy) of jammed configurations of Rydberg atoms on a one-dimensional lattice. Our method consists of provi…

math.CO2022★ 4 cited

On a variant of Flory model

Tomislav Došlić, Mate Puljiz, Stjepan Šebek +1

We consider a one-dimensional variant of a recently introduced settlement planning problem in which houses can be built on finite portions of the rectangular integer lattice subjec…

math.CO2021★ 3 cited

Packing density of combinatorial settlement planning models

Mate Puljiz, Stjepan Šebek, Josip Žubrinić

Recently, a combinatorial settlement planning model was introduced. The idea underlying the model is that the houses are randomly being built on a rectangular tract of land accordi…

math.CO2021★ 1 cited

Combinatorial settlement planning

Mate Puljiz, Stjepan Šebek, Josip Žubrinić

In this article, we consider a combinatorial settlement model on a rectangular grid where at least one side (east, south or west) of each house must be exposed to sunlight without…

math.FA2020★ 9 cited

Mean value theorem for quantum integral operator with application to sharp Ostrowski inequality

Andrea Aglić Aljinović, Domagoj Kovačević, Mate Puljiz +1

We derive a version of Lagrange's mean value theorem for quantum calculus. We disprove a version of Ostrowski inequality for quantum calculus appearing in the literature. We derive…

math.FA2020★ 3 cited

Erratum: Quantum Montgomery identity and quantum estimates of Ostrowski type inequalities

Andrea Aglić Aljinović, Domagoj Kovačević, Mate Puljiz

We disprove and correct some recently obtained results regarding Montgomery identity for quantum integral operator and Ostrowski type inequalities involving convex functions.

math.DS2017★ 19 cited

Shadowing, asymptotic shadowing and s-limit shadowing

Chris Good, Piotr Oprocha, Mate Puljiz

We study three notions of shadowing: classical shadowing, limit (or asymptotic) shadowing, and s-limit shadowing. We show that classical and s-limit shadowing coincide for tent map…

math.DS2016★ 4 cited

Almost Minimal Systems and Periodicity in Hyperspaces

Leobardo Fernández, Chris Good, Mate Puljiz

Given a self-map of a compact metric space , we study periodic points of the map induced on the hyperspace of closed subsets of . We give some necessary conditions on admissi…

math.PR2015★ 3 cited

Reaching consensus on a connected graph

John Haslegrave, Mate Puljiz

We study a simple random process in which vertices of a connected graph reach consensus through pairwise interactions. We compute outcome probabilities, which do not depend on the…