Related papers: Combinatorics of reductions between equivalence re…
We describe a large class of chemical reaction networks, those endowed with a subtle structural property called concordance. We show that the class of concordant networks coincides precisely with the class of networks which, when taken with…
It is a hard and important problem to find the criterion of the set of positive-definite matrixes which can be written as reduced density operators of a multi-partite quantum state. This problem is closely related to the study of many-body…
We devise exact conditions under which a join semilattice with a weak contact relation can be semilattice embedded into a Boolean algebra with an overlap contact relation, equivalently, into a distributive lattice with additive contact…
In this paper we investigate the general combinatorical structure of the truth tables of all bracketed formulae with n distinct variables connected by the binary connective of implication, an m-implication.
In psychological research often paired comparisons are used in which either full or partial profiles of the alternatives described by a common set of two-level attributes are presented. For this situation the problem of finding optimal…
We consider combinatorial properties of the Mills' ratio, and explore the interplay between a continued fraction expansion for the Mills' ratio, the Laplace polynomials and a new family of combinatorial identities.
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
Alternating bilinear maps with few relations allow to define a combinatorial closure similarly as in [2]. For the $\aleph_0$-categorical case we show that this closure is part of the algebraic closure.
The first aim of this paper is to show that any finite-dimensional reductive Lie algebra and its finite-dimensional completely reducible representation can be embedded into some PC Lie algebra. The second aim is to find the structure of a…
In this paper, we study the combinatorics of congruence subgroups of the modular group by generalizing results obtained in the non-modular case. For this, we define a notion of irreducible solutions from which we can build all the…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
We show how monoidal adjunctions can be used to prove the existence of monoidal abelian envelopes of pseudo-tensor categories, in particular, those admitting a combinatorial description with certain properties. We derive concrete general…
The main purpose of this survey is to provide an introduction, algebro-topological in nature, to Hirzebuch-type inequalities for plane curve arrangements in the complex projective plane. These inequalities gain more and more interest due to…
We present a close relationship between matching number, covering numbers and their fractional versions in combinatorial optimization and ordinary powers, integral closures of powers, and symbolic powers of monomial ideals. This…
The aim of this paper is to give new representation theorems for extended contact algebras. These representation theorems are based on equivalence relations.
We provide a generalization of first-order necessary conditions of optimality for infinite-dimensional optimization problems with a finite number of inequality constraints and with a finite number of inequality and equality constraints. Our…
The question of boundary conditions in conformal field theories is discussed, in the light of recent progress. Two kinds of boundary conditions are examined, along open boundaries of the system, or along closed curves or ``seams''. Solving…
We obtain a set of necessary and sufficient conditions for $| \bar{N}, p_{n} |_{k} $ to imply $|\bar{N}, q_{n} |_{s}$ for $1 < k \leq s < \infty$. Using this result we establish several inclusion theorems as well as conditions for the…
We involve a certain propositional logic based on ortholattices. We characterize the implicational reduct of such a logic and we show that its algebraic counterpart is the so-called orthosemilattice. Properties of congruences and congruence…
Occam's Razor tells us to pick the simplest model that fits our observations. In order to make sense of his process mathematically, we interpret it in the context of posets of functions. Our approach leads to some unusual new combinatorial…