Related papers: Combinatorial Derivation

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…

Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…

Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…

For a given graph $G$, we construct an associated commutative algebra, whose dimension is equal to the number of $t$-labeled forests of $G$. We show that the dimension of the $k$-th graded component of this algebra also has a combinatorial…

Partial dynamical systems (X,alpha) arise naturally when dealing with commutative C*-dynamical system (A,delta). We associate with every pair (X,alpha), or (A,delta), a covariance C*-algebra C*(X,alpha)=C*(A,delta) which agrees with a…

We consider descent data in cosimplicial crossed groupoids. This is a combinatorial abstraction of the descent data for gerbes in algebraic geometry. The main result is this: a weak equivalence between cosimplicial crossed groupoids induces…

The genus spectrum of a finite group $G$ is the set of all $g$ such that $G$ acts faithfully on a compact Riemann surface of genus $g$. It is an open problem to find a general description of the genus spectrum of the groups in interesting…

To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…

There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…

Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…

The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential…

For any affine semigroup $S$ the set $S\cup\{\infty\}$ has a natural structure of semigroup, additionally if $S$ is endowed with the discrete topology, the semigroup $S\cup\{\infty\}$ can be studied as the one-point compactification of $S$.…

More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also…

Let $R$ be a ring with involution containing a nontrivial symmetric idempotent element $e$. Let $\delta: R\rightarrow R$ be a mapping such that $\delta(ab)=\delta(b)a^{\ast}+b^{\ast}\delta(a)$ for all $a,b\in R$, we call $\delta$ a…

Combinatorial methods (or methods of elementary transformations) came to group theory from low-dimensional topology in the beginning of the century. Soon after that, combinatorial group theory became an independent area with its own…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

Let $\mathcal{A}$ be a real line arrangement and $\mathcal{D}(\mathcal{A})$ the module of $\mathcal{A}$-derivations view as the set of polynomial vector fields which possess $\mathcal{A}$ as an invariant set. We first characterize…

Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. The cardinality of a smallest super…

An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spaces, mostly from a topological point of view by a…