Related papers: The Borsuk-Ulam-property, Tucker-property and cons…
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…
In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
We discuss two approaches to producing generalized parity proofs of the Kochen-Specker theorem. Such proofs use contexts of observables whose product is $I$ or $-I$; we call them constraints. In the first approach, one starts with a fixed…
The goal of this article is to study how combinatorial equivalence implies topological conjugacy. For that, we introduce the concept of kneading sequences for nonautonomous discrete dynamical systems and show that these sequences are a…
We give a review of modern approaches to constructing formal solutions to integrable hierarchies of mathematical physics, whose coefficients are answers to various enumerative problems. The relationship between these approaches and…
For a finite group $H$ and connected topological spaces $X$ and $Y$ such that $X$ is endowed with a free left $H$-action $\tau$, we provide a geometric condition in terms of the existence of a commutative diagram of spaces (arising from the…
We systematize and analyze some results obtained in Subset Combinatorics of $G$ groups after publications the previous surveys [1-4]. The main topics: the dynamical and descriptive characterizations of subsets of a group relatively their…
We present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine…
We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
We study the application of Kasparov theory to topological insulator systems and the bulk-edge correspondence. We consider observable algebras as modelled by crossed products, where bulk and edge systems may be linked by a short exact…
Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…
The work starts a series of papers on topological radicals and their applications. Among other results we present a theory of radicals related to the joint tensor radius.
We give an elementary proof of a generalization of Rokhlin's lemma for commuting non-invertible measure-preserving transformations, and we present several combinatorial applications.
The concept of quasi-partial b-metric-like spaces is being introduced and studied with the help of topology. Examples are also discussed to support the results. Some fixed point theorems are proved in the setting of quasi-partial…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…