Searcharxiv⌕ Search

arXiv subjects

Dinh Van Le

Publications and source records attributed to Dinh Van Le.

13 recordsLinked to original sources

Invariant chains of graphs

We initiate a systematic study of Inc-invariant chains of graphs, the combinatorial counterparts of Inc-invariant chains of edge ideals arising in the theory of equivariant Noetherianity. Such a chain consists of graphs on growing vertex sets whose edge sets are compatible with the action of the monoid of strictly increasing maps on the positive integers. We show that several associated combinatorial invariants exhibit rigid asymptotic behavior. The independence number eventually stabilizes, and every fixed entry of the $f$-vector and the $h$-vector of the independence complex is eventually linear. For clique complexes, every fixed entry of the $f$-vector is eventually polynomial, whereas the entries of the $h$-vector are eventually quasi-polynomial. Moreover, the clique and chromatic numbers are eventually quasi-linear, and their difference is eventually at most one. We also prove that the matching number eventually attains the maximal value $\lfloor n/2\rfloor$. Finally, admissible and minimal paths eventually have lengths at most $3$ and $5$, respectively, and their maximal lengths stabilize. These results reveal strong asymptotic regularity in graph families governed by increasing symmetry.

math.CO↗

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↗

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↗

Minkowski-Weyl theorem and Gordan's lemma up to symmetry

We investigate equivariant analogues of the Minkowski--Weyl theorem and Gordan's lemma in an infinite-dimensional setting, where cones and monoids are invariant under the action of the infinite symmetric group. Building upon the framework developed earlier, we extend the theory beyond the nonnegative case. Our main contributions include a local equivariant Minkowski--Weyl theorem, local-global principles for equivariant finite generation and stabilization of symmetric cones, and a full proof of the equivariant Gordan's lemma. We also classify non-pointed symmetric cones and non-positive symmetric normal monoids, addressing new challenges in the general setting.

math.CO↗

On regularity and projective dimension of invariant chains of monomial ideals

Ideals in infinite-dimensional polynomial rings that are invariant under the action of the monoid of increasing functions have been extensively studied recently. Of particular interest is the asymptotic behavior of truncations of such an ideal in finite-dimensional polynomial subrings. It has been conjectured that the Castelnuovo--Mumford regularity and projective dimension are eventual linear functions along such truncations. In the present paper we provide evidence for these conjectures. We show that for monomial ideals the projective dimension is eventually linear, while the regularity is asymptotically linear.

math.AC↗

Asymptotic depth of invariant chains of edge ideals

We completely determine the asymptotic depth, equivalently, the asymptotic projective dimension of a chain of edge ideals that is invariant under the action of the monoid Inc of increasing functions on the positive integers. Our results and their proofs also reveal surprising combinatorial and topological properties of corresponding graphs and their independence complexes. In particular, we are able to determine the asymptotic behavior of all reduced homology groups of these independence complexes.

math.AC↗

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↗

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↗

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↗

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↗

Castelnuovo-Mumford regularity up to symmetry

We study the asymptotic behavior of the Castelnuovo-Mumford regularity along chains of graded ideals in increasingly larger polynomial rings that are invariant under the action of symmetric groups. A linear upper bound for the regularity of such ideals is established. We conjecture that their regularity grows eventually precisely linearly. We establish this conjecture in several cases, most notably when the ideals are Artinian or squarefree monomial.

math.AC↗

Codimension and Projective Dimension up to Symmetry

Symmetric ideals in increasingly larger polynomial rings that form an ascending chain are investigated. We focus on the asymptotic behavior of codimensions and projective dimensions of ideals in such a chain. If the ideals are graded it is known that the codimensions grow eventually linearly. Here this result is extended to chains of arbitrary symmetric ideals. Moreover, the slope of the linear function is explicitly determined. We conjecture that the projective dimensions also grow eventually linearly. As part of the evidence we establish two non-trivial lower linear bounds of the projective dimensions for chains of monomial ideals. As an application, this yields Cohen-Macaulayness obstructions.

math.AC↗

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↗