1. The Poetic Documentary as an Affective Configuration of Thinking-in-ProximityMaja Krajnc, 2025, izvirni znanstveni članek Opis: This article considers the poetic documentary as a dispositif that does not think in language, but in touch-in rhythms, in auditory tensions, in visual suspensions where the image does not speak but endures. Taking Vid Hajnšek’s A Tree Grows in My Dreams Every Night (V mojih sanjah rase vsako noč drevo, 2024) as its central case study, the article explores how a film – when it relinquishes narration and representation – can create the conditions in which thought no longer unfolds as conceptual reflection, but as an embodied orientation in a world that emerges within the frame. Perception is not treated as mediation between subject and object, but as a mode of being in which the body lingers in affect. The key concept is hesitation – as a tension that does not interrupt, but reconfigures the relation between image and body. The film does not ask what truth is, but how it might act – not as explanation, but as presence. Merging a phenomenological framework (Merleau-Ponty, Sobchack, Marks, Massumi, Sontag) with formal analysis (of framing, rhythm, sound, and texture), the article proposes that the poetic documentary does not produce knowledge, but generates the conditions in which thinking can happen – as affect, as duration, as proximity.
Ključne besede: poetic documentary, dispositif, hesitation, affect, A Tree Grows in My Dreams Every Night
Objavljeno v RUP: 22.01.2026; Ogledov: 194; Prenosov: 0
 Celotno besedilo (166,62 KB) |
2. Predicting Italian students’ mathematics outcomes : a decision tree regression analysisDaniel Doz, Darjo Felda, Mara Cotič, 2025, izvirni znanstveni članek Opis: The present paper aims to investigate the factors that influence the achievements of Italian students on the National Mathematics Assessment INVALSI. The study is a quantitative non-experimental research and utilizes the Decision Tree Method (DTM), a data mining and machine learning approach, to analyze the relationships and interactions among the variables and their influence on students’ mathematics performance. The sample for the study consists of 15,344 grade-10 students who took the INVALSI test in the school year 2021/22. Findings show that school typology had the highest relative importance, followed by students’ school grades in mathematics, socioeconomic status, geographic macroregion, gender, age, and, finally, origin. Based on these results, policymakers and educators should prioritize interventions that enhance educational environments and individual academic proficiency, particularly focusing on school type, mathematics grades, and students’ ESCS, to improve student achievements and promote deeper learning.
Ključne besede: INVALSI, decision tree, cross-validation, mathematics
Objavljeno v RUP: 19.01.2026; Ogledov: 186; Prenosov: 9
Celotno besedilo (1,12 MB)
Gradivo ima več datotek! Več... |
3. Numerical semigroups with distances no admisible between gaps greater than its multiplicityJ. C. Rosales, Manuel B. Branco, Márcio A. Traesel, 2025, izvirni znanstveni članek Opis: Let A pabe a nonempty subset of positive integers. In this paper we study the set of numerical semigroups that fulfill: if {x,y} ⊆ ℕ\S and x > y > min(S\{0}), then x-y ∉ A.
Ključne besede: Frobenius pseudo-varieties, genus number, numerical semigroups, PD(A)-semigroup and tree (associated to a PD(A)-semigroup)
Objavljeno v RUP: 21.12.2025; Ogledov: 217; Prenosov: 1
Celotno besedilo (356,42 KB) |
4. Plane triangulations without large 2-treesAllan Bickle, Gunnar Brinkmann, 2026, izvirni znanstveni članek Opis: In 1995 Leizhen Cai asked whether each plane triangulation has a spanning 2-tree. This question was recently answered in the negative by Bickle. He gave a plane triangulation on 38 vertices for which each 2-tree contained in it misses at least one vertex. We give a smaller example on 29 vertices and show that for each c>0 there are plane triangulations P=(V,E), so that each 2-tree that is a subgraph of P contains fewer than c|V| vertices. We also give a lower bound for the size of a maximum 2-tree in plane triangulations by proving that each plane triangulation P=(V,E) contains a 2-tree on at least log_2 (|V|-1)+4 -log_2 3 vertices. Finally we give structural criteria based on the decomposition trees of Jackson and Yu that guarantee the existence of spanning 2-trees in plane triangulations. The results are proven by using the close relation of 2-trees to hamiltonian cycles and to induced trees in the dual for plane triangulations without separating triangles.
Ključne besede: 2-tree, triangulation, Hamiltonian cycle, Yutsis partition
Objavljeno v RUP: 21.12.2025; Ogledov: 173; Prenosov: 1
Celotno besedilo (339,53 KB) |
5. Computing tree decompositions with small independence numberClément Jean Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanič, 2026, izvirni znanstveni članek Opis: The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the minimum independence number of a tree decomposition of it. Several NP-hard graph problems, like maximum-weight independent set, can be solved in time n^O(k) if the input n-vertex graph is given together with a tree decomposition of independence number k. Yolov, in SODA 2018, gave an algorithm that, given an n-vertex graph G and an integer k, in time n^O(k^3) either constructs a tree decomposition of G whose independence number is O(k^3) or correctly reports that the tree-independence number of G is larger than k. In this article, we first give an algorithm for computing the tree-independence number with a better approximation ratio and running time and then prove that our algorithm is, in some sense, the best one can hope for. Our second result is that the exact computation of the tree-independence number is para-NP-hard: We show that for every constant k ≥ 4 it is NP-complete to decide whether a given graph has the tree-independence number at most k.
Ključne besede: tree-independence number, approximation, parameterized algorithm
Objavljeno v RUP: 16.12.2025; Ogledov: 244; Prenosov: 3
Celotno besedilo (1,45 MB)
Gradivo ima več datotek! Več... |
6. Induced minor models : Structural properties and algorithmic consequencesNicolas Bousquet, Clément Jean Dallard, Maël Dumas, Claire Hilaire, Martin Milanič, Anthony Perez, Nicolas Trotignon, 2026, izvirni znanstveni članek Opis: A graph H is an induced minor of G if there exists an induced minor model of H in G, that is, a collection of pairwise disjoint subsets of vertices of G labeled by the vertices of H, each inducing a connected subgraph in G, such that two vertices of H are adjacent if and only if there is an edge in G between the corresponding subsets. In this paper, we investigate structural properties of induced minor models, including bounds on treewidth and chromatic number of the subgraphs induced by minimal induced minor models. As algorithmic applications of our structural results, we make use of recent developments regarding tree-independence number to show that if H is the 4-wheel, the 5-vertex complete graph minus an edge, or a complete bipartite graph K2,q , then there is a polynomial-time algorithm to find in a given graph G an induced minor model of H in G, if there is one. We also develop an alternative polynomial-time algorithm for recognizing graphs that do not contain K2,3 as an induced minor, which revolves around the idea of detecting the induced subgraphs whose presence is forced when the input graph contains K2,3 as an induced minor. It turns out that all these induced subgraphs are Truemper configurations.
Ključne besede: induced minor, treewidth, chromatic number, tree-independence number, Truemper configuration
Objavljeno v RUP: 16.12.2025; Ogledov: 215; Prenosov: 3
Celotno besedilo (1,44 MB)
Gradivo ima več datotek! Več... |
7. The independence polynomial of trees is not always log-concave starting from order 26Ohr Kadrawi, Vadim Levit, 2025, izvirni znanstveni članek Opis: An independent set in a graph is a collection of vertices that are not adjacent to each other. The cardinality of the largest independent set in G is represented by α(G). The independence polynomial of a graph G = (V, E) was introduced by Gutman and Harary in 1983 and is defined as
I(G; x) = Σ_{k = 0}^α(G) s_k x^k = s₀ + s₁x + s₂x² + ... + s_α(G)x^α(G), where sk represents the number of independent sets in G of size k.
The problem raised by Alavi, Malde, Schwenk, and Erdös in 1987 stated that the independence polynomials of trees are unimodal, and many researchers believed that this problem could be strengthened up to its corresponding log-concave version. However, in 2023, this conjecture was shown to be false by Kadrawi, Levit, Yosef, and Mizrachi. In this paper, we provide further evidence against this conjecture by presenting infinite families of trees with independence polynomials that are not log-concave.
Ključne besede: tree, independent set, independence polynomial, unimodality, log-concavity
Objavljeno v RUP: 22.10.2025; Ogledov: 353; Prenosov: 1
Celotno besedilo (352,77 KB) |
8. On relationships between treewidth, clique number, tree-independence number, and induced minors : master’s thesisÐorđe Vasić, 2025, magistrsko delo Ključne besede: treewidth, clique number, tree-independence number, induced minor, hered itary graph class, bipartite chain graph
Objavljeno v RUP: 11.09.2025; Ogledov: 697; Prenosov: 8
Celotno besedilo (839,36 KB) |
9. |
10. |
