Determinants and Möbius functions in trace monoids
نویسندگان
چکیده
We show that the independence relation deening a trace monoid M admits a transitive orientation if and only if the characteristic series of a lexicographic cross section of M satisses an equation of the form Det(Id ? X) = 1, where X is a matrix representing the minimum nite automaton recognizing and Id is the identity matrix. This implies that, if the independence relation of a trace monoid M admits a transitive orientation, then any unambiguous lifting of the MM obius function of M is the determinant of a matrix deened by the smallest acceptor of the corresponding cross section.
منابع مشابه
Möbius inversion formula for monoids with zero
The Möbius inversion formula, introduced during the 19th century in number theory, was generalized to a wide class of monoids called locally finite such as the free partially commutative, plactic and hypoplactic monoids for instance. In this contribution are developed and used some topological and algebraic notions for monoids with zero, similar to ordinary objects such as the (total) algebra o...
متن کاملUniform and Bernoulli measures on the boundary of trace monoids
Trace monoids and heaps of pieces appear in various contexts in combinatorics. They also constitute a model used in computer science to describe the executions of asynchronous systems. The design of a natural probabilistic layer on top of the model has been a long standing challenge. The difficulty comes from the presence of commuting pieces and from the absence of a global clock. In this paper...
متن کاملThe Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids
We prove that a trace monoid embeds into the queue monoid if and only if it embeds into the direct product of two free monoids. We also give a decidable characterization of these trace monoids.
متن کاملMatrix representations of trace monoids
We consider trace monoids i.e., free monoids where some pairs of letters are allowed to commute. We show that such monoids can be faithfully represented by 22-matrices with integer entries if and only if it they are direct products of a free commutative monoid with a free product of free commutative monoids.
متن کاملOn Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directions, including trace and rational monoids. Here, we investigate divisibility monoids which are defined by and capture algebraic properties sufficient to obtain a characterization of the recognizable languages by certain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 194 شماره
صفحات -
تاریخ انتشار 1999