相关论文: The combinatorics of combinatorial coding by a rea…

We consider Proof Complexity in light of the unusual binary encoding of certain combinatorial principles. We contrast this Proof Complexity with the normal unary encoding in several refutation systems, based on Resolution and Integer Linear…

We prove combinatorial theorems concerning the stick principle and cardinal characteristics.

We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…

The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…

We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…

This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…

A proof that the set of real numbers is denumerable is given.

For a variety with a finitely generated total coordinate ring, we describe basic geometric properties in terms of certain combinatorial structures living in its divisor class group. For example, we describe the singularities, we calculate…

In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial…

We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…

This article is an introduction to combinatorics under the axiom of determinacy with a focus on partition properties and infinity Borel codes.

We develop a framework for nonstandard analysis that gives foundations to the interplay between external and internal iterations of the star map, and we present a few examples to show the strength and flexibility of such a nonstandard…

Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in simple situations. This paper concerns binary radix systems, i.e., positional number systems with digits…

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 introduce poly-Cauchy permutations that are enumerated by the poly-Cauchy numbers. We provide combinatorial proofs for several identities involving poly-Cauchy numbers and some of their generalizations. The aim of this work is to…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation…

We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…