Related papers: Incidence Monoids: Automorphisms and Complexity

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

The rigidity degree of a generator-cogenerator determines the dominant dimension of its endomorphism algebra, and is closely related to a recently introduced homological dimension -- rigidity dimension. In this paper, we give explicit…

We prove that the cohomology algebra of elliptic arrangements depends only on the poset of layers. In the particular case of braid elliptic arrangements, we study the cohomology as representation and we compute some Hodge numbers. Finally,…

We study the Euler characteristic of the real Milnor fibres of a real analytic map, using a relation between complex monodromy and complex conjugation. We deduce the result of Coste and Kurdyka that the Euler characteristic of the link of…

We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…

We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…

We exhibit several posets arising from commutative algebra, order theory, tropical convexity as potential face posets of tropical polyhedra, and we clarify their inclusion relations. We focus on monomial tropical polyhedra, and deduce how…

It is proved that the generalized cluster complex defined by Fomin and Reading has a dihedral symmetry. Together with diagram symmetries, they generate its automorphism group. A consequence is a simple explicit formula for the order of this…

Every system of any significant size is created by composition from smaller sub-systems or components. It is thus fruitful to analyze the fault-tolerance of a system as a function of its composition. In this paper, two basic types of system…

The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…

Motivated by various developments in algebraic combinatorics and its applications, we investigate here the fine structure of a fundamental but little known theorem, the Gerstenhaber and Schack cohomology comparison theorem.The theorem…

The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…

We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…

We define the notions of a free fusion of structures and a weakly stationary independence relation. We apply these notions to prove simplicity for the automorphism groups of order and tournament expansions of homogeneous structures like the…

We present a number of second order maps, which pass the singularity confinement test commonly used to identify integrable discrete systems, but which nevertheless are non-integrable. As a more sensitive integrability test, we propose the…

We study the log-rank conjecture from the perspective of point-hyperplane incidence geometry. We formulate the following conjecture: Given a point set in $\mathbb{R}^d$ that is covered by constant-sized sets of parallel hyperplanes, there…

In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…

We prove that a quasi-finite endomorphism of an algebraic variety over an algebraically closed field of characteristic zero, that is injective on the complement of a closed subvariety, is an automorphism. We also prove that an endomorphism…

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…