Searcharxiv⌕ Search

arXiv subjects

Bogdan Ichim

Publications and source records attributed to Bogdan Ichim.

At least 19 recordsLinked to original sources
arXiv2023

Computations of volumes in five candidates elections

We describe several analytical results obtained in five candidates social choice elections under the assumption of the Impartial Anonymous Culture. These include the Condorcet and Borda paradoxes, as well as the Condorcet efficiency of plurality, negative plurality and Borda voting, including their runoff versions. The computations are done by Normaliz. It finds precise probabilities as volumes of polytopes in dimension 119, using its recent implementation of the Lawrence algorithm.

math.CO↗
arXiv2022

On the consistency of score sheets of a round-robin football tournament

In this paper we introduce the submonoids $\mathscr{R}_n$, resp. $\mathscr{C}_n$, of the monoid $\mathscr{M}_n$ of ordered score sheets of a robin-round tournament played by $n$ teams for which the order is preserved after the leader team is disqualified, resp. all principal submatrices preserve the given ordering. We study (using both theoretical and computational methods) the most important invariants of these monoids, namely the Hilbert basis, the multiplicity, the Hilbert series and the Hilbert function. In particular we give a general description of the Hilbert basis of $\mathscr{R}_n$ and we show that $\mathscr{C}_n$ is Gorenstein for $n>2$.

math.CO↗
arXiv2020

Polytope volume by descent in the face lattice and applications in social choice

We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high dimensional polytopes of different characteristics. Finally, we present an application to voting theory where polytope volumes appear as probabilities of certain paradoxa.

math.AC↗
arXiv2017

On the score sheets of a round-robin football tournament

The set of (ordered) score sheets of a round-robin football tournament played between $n$ teams together with the pointwise addition has the structure of an affine monoid. In this paper we study (using both theoretical and computational methods) the most important invariants of this monoid, namely the Hilbert basis, the multiplicity, the Hilbert series and the Hilbert function.

math.CO↗
arXiv2017

Computations of volumes and Ehrhart series in four candidates elections

We describe several experimental results obtained in four candidates social choice elections. These include the Condorcet and Borda paradoxes, as well as the Condorcet efficiency of plurality voting with runoff. The computations are done by Normaliz. It finds precise probabilities as volumes of polytopes and counting functions encoded as Ehrhart series of polytopes.

math.CO↗
arXiv2017

Stanley depth and the lcm-lattice

In this paper we show that the Stanley depth, as well as the usual depth, are essentially determined by the lcm-lattice. More precisely, we show that for quotients $I/J$ of monomial ideals $J\subset I$, both invariants behave monotonic with respect to certain maps defined on their lcm-lattice. This allows simple and uniform proofs of many new and known results on the Stanley depth. In particular, we obtain a generalization of our result on polarization presented in the reference [IKMF14]. We also obtain a useful description of the class of all monomial ideals with a given lcm-lattice, which is independent from our applications to the Stanley depth.

math.AC↗
arXiv2016

On the behavior of the size of a monomial ideal

In this paper we study the behavior of the size of a monomial ideal under polarization and under generic deformations. As an application, we extend a result relating the size and the Stanley depth of a squarefree monomial ideal obtained by Herzog, Popescu and Vladoiu, together with a parallel result obtained by Tang.

math.AC↗
arXiv2015

The power of pyramid decomposition in Normaliz

We describe the use of pyramid decomposition in Normaliz, a software tool for the computation of Hilbert bases and enumerative data of rational cones and affine monoids. Pyramid decomposition in connection with efficient parallelization and streamlined evaluation of simplicial cones has enabled Normaliz to process triangulations of size $\approx 5\cdot 10^{11}$ that arise in the computation of Hilbert series related to combinatorial voting theory.

math.CO↗
arXiv2015

How to compute the Stanley depth of a module

In this paper we introduce an algorithm for computing the Stanley depth of a finitely generated multigraded module $M$ over the polynomial ring $\mathbb{K}[X_1, \ldots, X_n]$. As an application, we give an example of a module whose Stanley depth is strictly greater than the depth of its syzygy module. In particular, we obtain complete answers for two open questions raised by Herzog. Moreover, we show that the question whether $M$ has Stanley depth at least $r$ can be reduced to the question whether a certain combinatorially defined polytope $\mathscr{P}$ contains a $\mathbb{Z}^n$-lattice point.

math.AC↗
arXiv2015

Lcm-lattices and Stanley depth: a first computational approach

Let $\mathbb{K}$ be a field, and let $S=\mathbb{K}[X_1, ..., X_n]$ be the polynomial ring. Let $I$ be a monomial ideal of $S$ with up to 5 generators. In this paper, we present a computational experiment which allows us to prove that $\mathrm{depth}_S S/I = \mathrm{sdepth}_S S/I < \mathrm{sdepth}_S I$. This shows that the Stanley conjecture is true for $S/I$ and $I$, if $I$ can be generated by at most 5 monomials. The result also brings additional computational evidence for a conjecture made by Herzog.

math.AC↗
arXiv2014

The behavior of Stanley depth under polarization

Let $K$ be a field, $R=K[X_1, ..., X_n]$ be the polynomial ring and $J \subsetneq I$ two monomial ideals in $R$. In this paper we show that $\mathrm{sdepth}\ {I/J} - \mathrm{depth}\ {I/J} = \mathrm{sdepth}\ {I^p/J^p}-\mathrm{depth}\ {I^p/J^p}$, where $\mathrm{sdepth}\ I/J$ denotes the Stanley depth and $I^p$ denotes the polarization. This solves a conjecture by Herzog and reduces the famous Stanley conjecture (for modules of the form $I/J$) to the squarefree case. As a consequence, the Stanley conjecture for algebras of the form $R/I$ and the well-known combinatorial conjecture that every Cohen-Macaulay simplicial complex is partitionable are equivalent.

math.AC↗
arXiv2014

An algorithm for computing the multigraded Hilbert depth of a module

A method for computing the multigraded Hilbert depth of a module was presented in [16]. In this paper we improve the method and we introduce an effective algorithm for performing the computations. In a particular case, the algorithm may also be easily adapted for computing the Stanley depth of the module. We further present interesting examples which were found with the help of an experimental implementation of the algorithm. Thus, we completely solve several open problems proposed by Herzog in [12].

math.AC↗
arXiv2013

How to compute the multigraded Hilbert depth of a module

The aim of this paper is to introduce a method for computing Hilbert decompositions (and consequently the Hilbert depth) of a finitely generated multigraded module $M$ over the polynomial ring $K[X_1,..., X_n]$ by reducing the problem to the computation of the finite set of the new defined Hilbert partitions. Moreover, in the last section, we show that Hilbert partitions may also be used for computing the Stanley depth of the module $M$.

math.AC↗
arXiv2010

Challenging computations of Hilbert bases of cones associated with algebraic statistics

In this paper we present two independent computational proofs that the monoid derived from $5\times 5\times 3$ contingency tables is normal, completing the classification by Hibi and Ohsugi. We show that Vlach's vector disproving normality for the monoid derived from $6\times 4\times 3$ contingency tables is the unique minimal such vector up to symmetry. Finally, we compute the full Hilbert basis of the cone associated with the non-normal monoid of the semi-graphoid for $|N|=5$. The computations are based on extensions of the packages LattE-4ti2 and Normaliz.

math.CO↗
arXiv2006

On canonical modules of toric face rings

Generalizing the concepts of Stanley-Reisner and affine monoid algebras, one can associate to a rational pointed fan the toric face ring. Assuming that this ring is Cohen-Macaulay, the main result of this paper is to characterize the situation when its canonical module is isomorphic to a fine graded ideal of the toric face ring. From this result several algebraic and combinatorial consequences are deduced in the situations where the fan may be related to a manifold with non-empty boundary, or the fan is a shellable fan.

math.AC↗
arXiv2006

On toric face rings

Following a construction of Stanley we consider toric face rings associated to rational pointed fans. This class of rings is a common generalization of the concepts of Stanley--Reisner and affine monoid algebras. The main goal of this article is to unify parts of the theories of Stanley--Reisner- and affine monoid algebras. We consider (non-pure) shellable fan's and the Cohen--Macaulay property. Moreover, we study the local cohomology, the canonical module and the Gorenstein property of a toric face ring.

math.AC↗
arXiv2005

On the Coefficients of Hilbert Quasipolynomials

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a purely algebraic proof of an old combinatorial result (due to Ehrhart, McMullen and Stanley).

math.AC↗