Related papers: Combinatorics of reductions between equivalence re…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
We analyse various structural and order-theoretical aspects of abstract separation systems and partial lattices, as well as the relationship between the different submodularity conditions one can impose on them.
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
In this paper we introduce and experimentally compare alternative algorithms to join uncertain relations. Different algorithms are based on specific principles, e.g., sorting, indexing, or building intermediate relational tables to apply…
In the paper the main attention is paid to conditions on algebras from a given variety which provide coincidence of their algebraic geometries. The main part here play the notions mentioned in the title of the paper.
In this paper, we study relations among several types of Eulerian polynomials from a combinatorial viewpoint. We establish an identity between the restricted Eulerian polynomials of types $A$ and $B$. As an application, we present a…
We introduce a new class of combinatorial markets in which agents have covering constraints over resources required and are interested in delay minimization. Our market model is applicable to several settings including scheduling, cloud…
There is a natural equivalence relation on representations of the states of a given quantum system in a Hilbert space, two representations being equivalent iff they are related by a unitary transformation. There are two equivalence classes,…
We expand the theoretical background of the recently introduced superadditive and subadditive transformations of aggregation functions $A$. Necessary and sufficient conditions ensuring that a transformation of a proper aggregation function…
We prove large and moderate deviation principles for the distribution of an empirical mean conditioned by the value of the sum of discrete i.i.d. random variables. Some applications for combinatoric problems are discussed.
In this work we study the applicability of the Equivalence Theorem, either for unitary models or within an effective lagrangian approach. There are two types of limitations: the existence of a validity energy window and the use of the…
The temporal relations that hold between events described by successive utterances are often left implicit or underspecified. We address the role of two phenomena with respect to the recovery of these relations: (1) the referential…
We define a relation that describes the ternary commutator for congruence modular varieties. Properties of this relation are used to investigate the theory of the higher commutator for congruence modular varieties.
General criteria are given for when an embedding of a Mori dream space into another satisfies certain nice combinatorial conditions on some of their associated cones. An explicit example of such an embedding is studied.
A sufficient condition for the simplicity of induced modules of reductive Lie algebras is given.
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…
This note presents a unified theorem of the alternative that explicitly allows for any combination of equality, componentwise inequality, weak dominance, strict dominance, and nonnegativity relations. The theorem nests 60 special cases,…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.