arXiv subjects

Tim Römer

Publications and source records attributed to Tim Römer.

At least 19 recordsLinked to original sources

arXiv2026

Duality of monoids up to symmetry

We study duality for monoids in an infinite-dimensional setting that are invariant under the action of the infinite symmetric group Sym. Our main result is an equivariant Minkowski--Weyl theorem for monoids. More precisely, we analyze the evolution of dual monoids along stabilizing Sym-invariant chains and describe the eventual behavior of their equivariant Hilbert bases. In addition, we develop a systematic study of structural properties of dual symmetric monoids, including a characterization of the duals of positive and non-positive monoids.

math.CO↗

arXiv2026

On monoids up to symmetry

We study monoids in an infinite-dimensional setting that are invariant under the action of the infinite symmetric group Sym. Our main result establishes a local--global principle characterizing equivariant finite generation for arbitrary Sym-invariant monoids, extending earlier results that required additional assumptions. We further analyze local--global phenomena for other fundamental properties, including positivity, normality, seminormality, and simplicity. In addition, we obtain structural results for symmetric monoids, including characterizations of positivity and non-positivity, a description of their groups of units, and explicit formulas for the ranks of local symmetric monoids and stabilizing Sym-invariant chains.

math.CO↗

arXiv2025

PHEATPRUNER: Interpretable Data-centric Feature Selection for Multivariate Time Series Classification through Persistent Homology

Balancing performance and interpretability in multivariate time series classification is a significant challenge due to data complexity and high dimensionality. This paper introduces PHeatPruner, a method integrating persistent homology and sheaf theory to address these challenges. Persistent homology facilitates the pruning of up to 45% of the applied variables while maintaining or enhancing the accuracy of models such as Random Forest, CatBoost, XGBoost, and LightGBM, all without depending on posterior probabilities or supervised optimization algorithms. Concurrently, sheaf theory contributes explanatory vectors that provide deeper insights into the data's structural nuances. The approach was validated using the UEA Archive and a mastitis detection dataset for dairy cows. The results demonstrate that PHeatPruner effectively preserves model accuracy. Furthermore, our results highlight PHeatPruner's key features, i.e. simplifying complex data and offering actionable insights without increasing processing time or complexity. This method bridges the gap between complexity reduction and interpretability, suggesting promising applications in various fields.

cs.LG↗

arXiv2024

Componentwise linear symbolic powers of edge ideals and Minh's conjecture

In this paper, we study the componentwise linearity of symbolic powers of edge ideals. We propose the conjecture that all symbolic powers of the edge ideal of a cochordal graph are componentwise linear. This conjecture is verified for some families of cochordal graphs, including complements of block graphs and complements of proper interval graphs. As a corollary, Minh's conjecture is established for such families. Moreover, we show that $I(G)^{(2)}$ is componentwise linear, for any cochordal graph $G$.

math.AC↗

arXiv2024

Simplicial complexes in network intrusion profiling

For studying intrusion detection data we consider data points referring to individual IP addresses and their connections: We build networks associated with those data points, such that vertices in a graph are associated via the respective IP addresses, with the key property that attacked data points are part of the structure of the network. More precisely, we propose a novel approach using simplicial complexes to model the desired network and the respective intrusions in terms of simplicial attributes thus generalizing previous graph-based approaches. Adapted network centrality measures related to simplicial complexes yield so-called patterns associated to vertices, which themselves contain a set of features. These are then used to describe the attacked or the attacker vertices, respectively. Comparing this new strategy with classical concepts demonstrates the advantages of the presented approach using simplicial features for detecting and characterizing intrusions.

math.AC↗

arXiv2023

Equivariant lattice bases

We study lattices in free abelian groups of infinite rank that are invariant under the action of the infinite symmetric group, with emphasis on finiteness of their equivariant bases. Our framework provides a new method for proving finiteness results in algebraic statistics. As an illustration, we show that every invariant lattice in $\mathbb{Z}^{(\mathbb{N}\times[c])}$, where $c\in\mathbb{N}$, has a finite equivariant Graver basis. This result generalizes and strengthens several finiteness results about Markov bases in the literature.

math.CO↗

arXiv2023

Theorems of Carathéodory, Minkowski-Weyl, and Gordan up to symmetry

In this paper we extend three classical and fundamental results in polyhedral geometry, namely, Carathéodory's theorem, the Minkowski-Weyl theorem, and Gordan's lemma to infinite dimensional spaces, in which considered cones and monoids are invariant under actions of symmetric groups.

math.CO↗

arXiv2022

Covariance matrices of length power functionals of random geometric graphs -- an asymptotic analysis

Asymptotic properties of a vector of length power functionals of random geometric graphs are investigated. More precisely, its asymptotic covariance matrix is studied as the intensity of the underlying homogeneous Poisson point process increases. This includes a systematic discussion of matrix properties like rank, definiteness, determinant, eigenspaces or decompositions of interest. For the formulation of the results a case distinction is necessary. Indeed, in the three possible regimes the respective covariance matrix is of quite different nature which leads to different statements. Finally, stochastic consequences for random geometric graphs are derived.

math.PR↗

arXiv2022

Algebraic properties of Levi graphs associated with curve arrangements

In the present paper we study algebraic properties of edge ideals associated with plane curve arrangements via their Levi graphs. Using combinatorial properties of such Levi graphs we are able to describe those monomial algebras being Cohen-Macaulay, Buchsbaum, and sequentially Cohen-Macaulay. We also condsider the projective dimension and the Castelnuovo-Mumford regularity for these edge ideals. We provide effective lower and upper bounds on them. As a byproduct of our study we connect, in general, various Buchsbaum properties of squarefree modules.

math.AC↗

arXiv2022

Invariant chains in algebra and discrete geometry

We relate finite generation of cones, monoids, and ideals in increasing chains (the local situation) to equivariant finite generation of the corresponding limit objects (the global situation). For cones and monoids there is no analog of Noetherianity as in the case of ideals and we demonstrate this in examples. As a remedy, we find local-global correspondences for finite generation. These results are derived from a more general framework that relates finite generation under closure operations to equivariant finite generation under general families of maps. We also give a new proof that non-saturated Inc-invariant chains of ideals stabilize, closing a gap in the literature.

math.CO↗

arXiv2021

Classes of cut ideals and their Betti numbers

We study monomial cut ideals associated to a graph $G$, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and Castelnuovo-Mumford regularities are investigated if the graph can be decomposed as $0$-clique sums and disjoint union of subgraphs. The total Betti numbers of a cycle are computed. Moreover, we classify all Freiman ideals among monomial cut ideals.

math.AC↗

arXiv2021

Seminormality, canonical modules, and regularity of cut polytopes

Motivated by a conjecture of Sturmfels and Sullivant we study normal cut polytopes. After a brief survey of known results for normal cut polytopes it is in particular observed that for simplicial and simple cut polytopes their cut algebras are normal and hence Cohen--Macaulay. Moreover, seminormality is considered. It is shown that the cut algebra of $K_5$ is not seminormal which implies again the known fact that it is not normal. For normal Gorenstein cut algebras and other cases of interest we determine their canonical modules. The Castelnuovo-Mumford regularity of a cut algebra is computed for various types of graphs and bounds for it are provided if normality is assumed. As an application we classify all graphs for which the cut algebra has regularity less than or equal to 4.

math.CO↗

arXiv2021

Cycle algebras and polytopes of matroids

Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an algebraic and geometric investigation of these polytopes by studying their toric algebras, called cycle algebras, and their defining ideals. Several matroid operations are considered which determine faces of cycle polytopes that belong again to this class of polyhedral objects. As a key technique used in this paper, we study certain minors of given matroids which yield algebra retracts on the level of cycle algebras. In particular, that allows us to use a powerful algebraic machinery. As an application, we study highest possible degrees in minimal homogeneous systems of generators of defining ideals of cycle algebras as well as interesting cases of cut polytopes and Eulerian subgraph polytopes.

math.CO↗

arXiv2020

Betti numbers of symmetric shifted ideals

We introduce a new class of monomial ideals which we call symmetric shifted ideals. Symmetric shifted ideals are fixed by the natural action of the symmetric group and, within the class of monomial ideals fixed by this action, they can be considered as an analogue of stable monomial ideals within the class of monomial ideals. We show that a symmetric shifted ideal has linear quotients and compute its (equivariant) graded Betti numbers. As an application of this result, we obtain several consequences for graded Betti numbers of symbolic powers of defining ideals of star configurations.

math.AC↗

arXiv2020

Asymptotic behavior of symmetric ideals: A brief survey

Recently, chains of increasing symmetric ideals have attracted considerable attention. In this note, we summarize some results and open problems concerning the asymptotic behavior of several algebraic and homological invariants along such chains, including codimension, projective dimension, Castelnuovo-Mumford regularity, and Betti tables.

math.AC↗

arXiv2020

Learning algebraic decompositions using Prony structures

We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums, polynomials (with respect to the monomial and Chebyshev bases), Gaußian sums, spherical harmonic sums, taking also into account whether they have their support on an algebraic set.

math.AC↗

arXiv2019

A Kruskal-Katona type result and applications

Inspired by the Kruskal-Katona theorem a minimization problem is studied, where the role of the shadow is replaced by the image of the action of the monoid of increasing functions. One of our main results shows that compressed sets are a solution to this problem. Several applications to simplicial complexes are discussed.

math.CO↗

arXiv2019

Cut Polytopes of Minor-free Graphs

The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut polytopes of $K_{3,3}$-minor-free graphs and introduce an algorithm solving MaxCut on those graphs, which only requires the running time of planar MaxCut. Moreover, starting a systematic geometric study of cut polytopes, we classify graphs admitting a simple or simplicial cut polytope.

math.CO↗