Related papers: Combinatorics of cyclic-conditional freeness
In this paper we develop constructive invertibility conditions for the twisted convolution. Our approach is based on splitting the twisted convolution with rational parameters into a finite number of weighted convolutions, which can be…
We prove Terao conjecture saying that the freeness is determined by the combinatorics for arrangements of 13 lines in the complex projective plane and that the property of being nearly free is combinatorial for line arrangements of up to 12…
We present a relativistic formulation of noncommutative mechanics were the object of noncommutativity $\theta^{\mu\nu}$ is considered as an independent quantity. Its canonical conjugate momentum is also introduced, what permits to obtain an…
It is well known that conditional independence can be used to factorize a joint probability into a multiplication of conditional probabilities. This paper proposes a constructive definition of inter-causal independence, which can be used to…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…
Following Ellis, we investigate the notion of totally free crossed squares and related square complexes. It is shown how to interpret the information in a free simplicial group given with a choice of CW-basis, in terms of the data for a…
In the theory of hyperplane arrangements, the most important and difficult problem is the combinatorial dependency of several properties. In this atricle, we prove that Terao's celebrated addition-deletion theorem for free arrangements is…
Conditional independence and Markov properties are powerful tools allowing expression of multidimensional probability distributions by means of low-dimensional ones. As multidimensional possibilistic models have been studied for several…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
This paper is devoted to the construction of conditional logic system of {\L}ukasiewicz m-valued propositional logic. We construct conditional logic system {\L}CR based on {\L}ukasiewicz m-valued propositional logic. We construct world…
We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…
It is well known that free independence is equivalent to the vanishing of mixed free cumulants. The purpose of this short note is to build free products of $*$-probability spaces using this as the definition of freeness and relying on free…
We consider the infinitesimal freeness in the operator-valued framework, and we show that the operator-valued infinitesimal (OVI) free independence is equivalent to the operator-valued free independence over an algebra of $2\times 2$ upper…
Since Voiculescu introduced his bi-free probability theory in 2013, the major development of the theory has been on its combinatorial side; in particular, on the combinatorics of bi-free cumulants and its application to the bi-free…
Defant found that the relationship between a sequence of (univariate) classical cumulants and the corresponding sequence of (univariate) free cumulants can be described combinatorially in terms of families of binary plane trees called…
We pursue the current developments in random tensor theory by laying the foundations of a free probability theory for tensors and establish its relevance in the study of random tensors of high dimension. We give a definition of freeness…
A combinatorial approach to free probability theory has been developped by Roland Speicher, based on the notion of noncrossing cumulants, a free analogue of the classical theory of cumulants in probability theory. We review this theory, and…
We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of…