相关论文: Some advances on the set covering polyhedron of ci…

The conjugation action of the complex orthogonal group on the polynomial functions on $n \times n$ matrices gives rise to a graded algebra of invariant polynomials. A spanning set of this algebra is in bijective correspondence to a set of…

The study of separating invariants is a recent trend in invariant theory. For a finite group acting linearly on a vector space, a separating set is a set of invariants whose elements separate the orbits of G. In some ways, separating sets…

In this paper, we introduce new classes of functions that extend the known classes of functions of complex variable, such as entire functions, meromorphic functions, rational functions and polynomial functions and take values in the set of…

Double circulant matrices are introduced and studied. A formula to compute the rank r of a double circulant matrix is exhibited; and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a…

In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

The affinely regular polygons in certain planar sets are characterized. It is also shown that the obtained results apply to cyclotomic model sets and, additionally, have consequences in the discrete tomography of these sets.

Motivated by the Milnor fiber of a central arrangement, we study the cohomology of a family of cyclic covers of the complement of an arbitrary arrangement. We give an explicit proof of the polynomial periodicity of the Betti numbers of the…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

We consider a family of schemes, that are defined by minors of a homogeneous symmetric matrix with polynomial entries. We assume that they have maximal possible codimension, given the size of the matrix and of the minors that define them.…

A minimal separating set is found for the algebra of matrix invariants of several 2x2 matrices over an infinite field of arbitrary characteristic

We establish an analogue of the fundamental theorem of algebra for polynomial matrix equations, in which the matrices-coefficients and unknown matrix are assumed to be circulant matrices.

In this paper we prove discrete Poincar\'e inequalities that are uniform in the mesh size for the discrete de Rham complex of differential forms developed in [Bonaldi, Di Pietro, Droniou, and Hu, An exterior calculus framework for polytopal…

We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. Sharp analogues of McMullen's generalized lower bounds, and of Barnette's lower bounds, are conjectured for these…

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

A compound determinant identity for minors of rectangular matrices is established. As an application, we derive Vandermonde type determinant formulae for classical group characters.

We generalize Gaeta's Theorem to the family of determinantal schemes. In other words, we show that the schemes defined by minors of a fixed size of a matrix with polynomial entries belong to the same G-biliaison class of a complete…

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…