Related papers: Combinatorics of reductions between equivalence re…

We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.

This paper deals with retraction - intended as isomorphic embedding - in intersection types building left and right inverses as terms of a lambda calculus with a bottom constant. The main result is a necessary and sufficient condition two…

We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.

This paper deals with the comparison of two common types of equivalence groups of differential equations, and this gives rise to a number of results presented in the form of theorems. It is shown in particular that one type can be…

We investigate several consequences of inclusion relations between quantified provability logics. Moreover, we give a necessary and sufficient condition for the inclusion relation between quantified provability logics with respect to…

In this survey we discuss the notion of combinatorial interpretation in the context of Algebraic Combinatorics and related areas. We approach the subject from the Computational Complexity perspective. We review many examples, state a…

We study possible Lie and non-classical reductions of multidimensional wave equations and the special classes of possible reduced equations - their symmetries and equivalence classes. Such investigation allows to find many new conditional…

Integrability conditions for Lie systems are related to reduction or transformation processes. We here analyse a geometric method to construct integrability conditions for Riccati equations following these approaches. This approach provides…

We discuss a selection of recent developments in arithmetic combinatorics having to do with ``approximate algebraic structure'' together with some of their applications.

In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occurring in a word.

The order relations of continuous cancellative t-subnorms are discussed. First, we present some necessary and sufficient conditions along with several interesting sufficient criteria for the comparability of continuous cancellative…

We show that moment inequalities in a wide variety of economic applications have a particular linear conditional structure. We use this structure to construct uniformly valid confidence sets that remain computationally tractable even in…

We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.

We find conditions equivalent to some commutator identities considered in Part I

For paired comparison experiments involving competing options described by two-level attributes several different methods of constructing designs having block paired observations under the main effects model are presented. These designs are…

Complete sets of commutation relations for arbitrary pairs of quantum minors are computed, with explicit coefficients in closed form.

The connection between inequalities in additive combinatorics and analogous versions in terms of the entropy of random variables has been extensively explored over the past few years. This paper extends a device introduced by Ruzsa in his…

It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the…

We derive some equalities for relations on the algebra A, under the assumption that every subalgebra of A $\times$ A is congruence modular.

Symmetries and reductions of some algebraic equations are considered. Transformations that preserve the form of several algebraic equations, as well as transformations that reduce the degree of these equations, are described. Illustrative…