Related papers: The Definability Strength of Combinatorial Princip…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
We present an standard constraints generation algorithm to find an explicit set whose robustness is equal to the robustness of the feasible solution set of a combinatorial optimization problem with cost uncertainty. Computational experience…
We compare the strength of polychromatic and monochromatic Ramsey theory in several set-theoretic domains. We show that the rainbow Ramsey theorem does not follow from ZF, nor does the rainbow Ramsey theorem imply Ramsey's theorem over ZF.…
Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that…
Team Semantics is a generalization of Tarskian Semantics that can be used to add to First Order Logic atoms and connectives expressing dependencies between the possible values of variables. Some of these extensions are more expressive than…
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,…
Robust tests of general composite hypothesis under non-identically distributed observations is always a challenge. Ghosh and Basu (2018, Statistica Sinica, 28, 1133--1155) have proposed a new class of test statistics for such problems based…
Introducing the notion of a rational system of measure preserving transformations and proving a recurrence result for such systems, we give sufficient conditions in order a subset of rational numbers to contain arbitrary long arithmetic…
In the last years the attention towards topological dynamical properties of highly discontinuous maps has increased significantly. In [D.Corona, A. Della Corte. The critical exponent functions. Comptes Rendus Math\'ematique, 360(G4),…
We study Extremal Combinatorics problems where local properties are used to derive global properties. That is, we consider a given configuration where every small piece of the configuration satisfies some restriction, and use this local…
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…
As the discipline has evolved, research in machine learning has been focused more and more on creating more powerful neural networks, without regard for the interpretability of these networks. Such "black-box models" yield state-of-the-art…
Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…
We study the reverse mathematics of pigeonhole principles for finite powers of the ordinal $\omega$. Four natural formulations are presented and their relative strengths are compared. In the analysis of the pigeonhole principle for…
In fragments of first order arithmetic, definable maps on finite domains could behave very differently from finite maps. Here combinatorial properties of $\Sigma_{n+1}$-definable maps on finite domains are compared in the absence of…
Gamma uncertainty sets have been introduced for adjusting the degree of conservatism of robust counterparts of (discrete) linear programs. The contribution of this paper is a generalization of this approach to (mixed integer) nonlinear…
We introduce and study several notions of computability-theoretic reducibility between subsets of $\omega$ that are "robust" in the sense that if only partial information is available about the oracle, then partial information can be…
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…
Sets satisfying Central sets theorem and other Ramsey theoretic large sets were studied extensively in literature. Hindman and Strauss proved that product of some of these large sets is again large. In this paper we show that if we take two…
We introduce new types of local algorithms, which we call "ASI Algorithms", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to unify arguments from the two fields, and also sometimes to…