arXiv subjects

Hugues Verdure

Publications and source records attributed to Hugues Verdure.

17 recordsLinked to original sources

arXiv2024

Homotopy type of shellable $q$-complexes and their homology groups

The theory of shellable simplicial complexes brings together combinatorics, algebra, and topology in a remarkable way. Initially introduced by Alder for $q$-simplicial complexes, recent work of Ghorpade, Pratihar, and Randrianarisoa extends the study of shellability to $q$-matroid complexes and determines singular homology groups for a subclass of these $q$-simplicial complexes. In this paper, we determine the homotopy type of shellable $q$-simplicial complexes. Moreover, we establish the shellability of order complexes from lexicographically shellable $q$-simplicial complexes, that include the $q$-matroid complexes. This results in a comprehensive determination of the homology groups for any lexicographically shellable $q$-complexes.

math.CO↗

arXiv2023

Symmetric SAGE and SONC forms, exactness and quantitative gaps

The classes of sums of arithmetic-geometric exponentials (SAGE) and of sums of nonnegative circuit polynomials (SONC) provide nonnegativity certificates which are based on the inequality of the arithmetic and geometric means. We study the cones of symmetric SAGE and SONC forms and their relations to the underlying symmetric nonnegative cone. As main results, we provide several symmetric cases where the SAGE or SONC property coincides with nonnegativity and we present quantitative results on the differences in various situations. The results rely on characterizations of the zeroes and the minimizers for symmetric SAGE and SONC forms, which we develop. Finally, we also study symmetric monomial mean inequalities and apply SONC certificates to establish a generalized version of Muirhead's inequality.

math.OC↗

arXiv2023

Symmetries in polynomial optimization

This chapter investigates how symmetries can be used to reduce the computational complexity in polynomial optimization problems. A focus will be specifically given on the Moment-SOS hierarchy in polynomial optimization, where results from representation theory and invariant theory of groups can be used. In addition, symmetry reduction techniques which are more generally applicable are also presented.

math.OC↗

arXiv2022

The poset of Specht ideals for hyperoctahedral groups

Specht polynomials classically realize the irreducible representations of the symmetric group. The ideals defined by these polynomials provide a strong connection with the combinatorics of Young tableaux and have been intensively studied by several authors. We initiate similar investigations for the ideals defined by the Specht polynomials associated to the hyperoctahedral group $B_n$. We introduce a bidominance order on bipartitions which describes the poset of inclusions of these ideals and study algebraic consequences on general $B_n$-invariant ideals and varieties, which can lead to computational simplifications.

math.CO↗

arXiv2021

Weight Spectra of Gabidulin Rank-metric Codes and Betti Numbers

We consider $q$-matroids and their associated classical matroids derived from Gabidulin rank-metric codes. We express the generalized rank weights of a Gabidulin rank-metric code in terms of Betti numbers of the dual classical matroid associated to the $q$-matroid corresponding to the code. In our main result, we show how these Betti numbers and their elongations determine the generalized weight polynomials for $q$-matorids, in particular, for the Gabidulin rank-metric codes. In addition, we demonstrate how the weight distribution and higher weight spectra of such codes can be determined directly from the associated $q$-matroids by using M\"{o}bius functions of its lattice of $q$-flats.

math.CO↗

arXiv2021

Symmetry reduction in AM/GM-based optimization

The arithmetic mean/geometric mean-inequality (AM/GM-inequality) facilitates classes of non-negativity certificates and of relaxation techniques for polynomials and, more generally, for exponential sums. Here, we present a first systematic study of the AM/GM-based techniques in the presence of symmetries under the linear action of a finite group. We prove a symmetry-adapted representation theorem and develop techniques to reduce the size of the resulting relative entropy programs. We study in more detail the complexity gain in the case of the symmetric group. In this setup, we can show in particular certain stabilization results. We exhibit several sequences of examples in growing dimensions where the size of the problem stabilizes. Finally, we provide some numerical results, emphasizing the computational speed-up.

math.OC↗

arXiv2020

Greedy weights for matroids

We introduce greedy weights of matroids, inspired by those for linear codes. We show that a Wei duality holds for two of these types of greedy weights for matroids. Moreover we show that in the cases where the matroids involved are associated to linear codes, our definitions coincide with those for codes. Thus our Wei duality is a generalization of that for linear codes given by Schaathun. In the last part of the paper we show how some important chains of cycles of the matroids appearing, correspond to chains of component maps of minimal resolutions of the independence complex of the corresponding matroids. We also relate properties of these resolutions to chainedness and greedy weights of the matroids, and in many cases codes, that appear.

cs.IT↗

arXiv2019

Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations

An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the leading monomials of polynomials in the ideal and the Specht polynomials contained in the ideal. This provides applications in several contexts. Most notably, this connection gives information about the solutions of the corresponding set of equations. From another perspective, it restricts the isotypic decomposition of the ideal viewed as a representation of the symmetric group.

math.AG↗

arXiv2019

Higher weight spectra of Veronese codes

We study q-ary linear codes C obtained from Veronese surfaces over finite fields. We show how one can find the higher weight spectra of these codes, or equivalently, the weight distribution of all extension codes of C over all field extensions of the field with q elements. Our methods will be a study of the Stanley-Reisner rings of a series of matroids associated to each code C

math.CO↗

arXiv2017

Flags of almost affine codes

We describe a two-party wire-tap channel of type II in the framework of almost affine codes. Its cryptological performance is related to some relative profiles of a pair of almost affine codes. These profiles are analogues of relative generalized Hamming weights in the linear case.

cs.IT↗

arXiv2016

Generalized Hamming weights for almost affine codes

We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap channels of type II, apply to the larger class of almost affine codes in general. In addition we discuss duality of almost affine codes,and of the smaller class of multilinear codes. We also give results about weight distributions of infinite series of almost affine codes, each series obtained from a fixed code by extending the code alphabet.

cs.IT↗

arXiv2015

A generalization of Kung's theorem

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m such that there exist m codewords whose union of supports has cardinality at least i.

cs.IT↗

arXiv2015

Betti numbers of skeletons

We demonstrate that the Betti numbers associated to an N-graded minimal free resolution of the Stanley-Reisner ring of the (d-1)-skeleton of a simplicial complex of dimension d can be expressed as a Z-linear combination of the corresponding Betti numbers of the complex itself. An immediate implication of our main result is that the projective dimension of the Stanley-Reisner ring of the (d-1)-skeleton is at most one greater than the projective dimension of the Stanley-Reisner ring of the original complex, and it thus provides a new and direct proof of this. Our result extends immediately to matroids and their truncations. A similar result for matroid elongations can not be hoped for, but we do obtain a weaker result for these.

math.CO↗

arXiv2013

A generalization of weight polynomials to matroids

Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid $M$. Our main result is that these polynomials are determined by Betti numbers associated with graded minimal free resolutions of the Stanley-Reisner ideals of $M$ and so-called elongations of $M$. Generalizing Greene's theorem from coding theory, we show that the enumerator of a matroid is equivalent to its Tutte polynomial.

math.CO↗

arXiv2012

Betti numbers associated to the facet ideal of a matroid

To a matroid M with n edges, we associate the so-called facet ideal F(M) generated by monomials corresponding to bases of M. We show that the Betti numbers related to an N-graded minimal free resolution of F(M) are determined by the Betti numbers related to the blocks of M. Similarly, we show that the higher weight hierarchy of M is determined by the weight hierarchies of the blocks, as well. Drawing on these results, we show that when M is the cycle matroid of a cactus graph, the Betti numbers determine the higher weight hierarchy -- and vice versa. Finally, we demonstrate by way of counterexamples that this fails to hold for outerplanar graphs in general.

math.CO↗

arXiv2012

Stanley-Reisner resolution of constant weight linear codes

Given a constant weight linear code, we investigate its weight hierarchy and the Stanley-Reisner resolution of its associated matroid regarded as a simplicial complex. We also exhibit conditions on the higher weights sufficient to conclude that the code is of constant weight

cs.DM↗

arXiv2011

Hamming weights and Betti numbers of Stanley-Reisner rings associated to matroids

To each linear code over a finite field we associate the matroid of its parity check matrix. We show to what extent one can determine the generalized Hamming weights of the code (or defined for a matroid in general) from various sets of Betti numbers of Stanley-Reisner rings of simplicial complexes associated to the matroid.

math.CO↗