Related papers: Partial orders and immunity in reverse mathematics
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…
Partial algebras and datatypes are discussed with the use of signatures that allow partial functions, and a three-valued short-circuit (sequential) first order logic with a Tarski semantics. The propositional part of this logic is also…
We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the…
We consider a generalisation of the classical Lehmer problem about the parity distribution of an integer and its modular inverse. We use some known estimates of exponential sums to study a more general question of simultaneous distribution…
We review the notion of reducibility and we introduce and discuss the notion of orbital reducibility for autonomous ordinary differential equations of first order. The relation between (orbital) reducibility and (orbital) symmetry is…
The minus partial order is already known for sets of matrices over a field and bounded linear operators on arbitrary Hilbert spaces. Recently, this partial order has been studied on Rickart rings. In this paper, we extend the concept of the…
This thesis is divided into three parts. The first part deals with cylindric plane partitions. The second with lambda-determinants and the third with commutators in semi-circular systems. For more detailed abstract please see inside.…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…
We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the com- mon…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
Recently, the concept of parity bias in integer partitions has been studied by several authors. We continue this study here, but for non-unitary partitions (namely, partitions with parts greater than $1$). We prove analogous results for…
We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…
A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S\{0} is finitely coloured, there is a solution to the system contained in one colour class. It has been known for some…
This paper is devoted to the study of the separability problem in the field of Quantum information theory. We deal mainly with the bipartite finite dimensional case and with two types of matrices, one of them being the PPT matrices. We…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
Issues concerning intelligent data analysis occurring in machine learning are investigated. A scheme for synthesizing correct supervised classification procedures is proposed. These procedures are focused on specifying partial order…
We investigate the separability of arbitrary dimensional tripartite sys- tems. By introducing a new operator related to transformations on the subsystems a necessary condition for the separability of tripartite systems is presented.