Related papers: Width and size of regular resolution proofs
Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…
We consider the discrepancy of the integer lattice with respect to the collection of all translated copies of a dilated convex body having a finite number of flat, possibly non-smooth, points in its boundary. We estimate the $L^{p}$ norm of…
We describe the resolution of singularities of a threefold which has minimal Picard number. We describe the relation between this minimal resolution and an arbitrary resolution of singularities.
The aim of this note is to show that Poincar\'e inequalities imply corresponding weighted versions in a quite general setting. Fractional Poincar\'e inequalities are considered, too. The proof is short and does not involve covering…
The Favard length of a Borel set $E\subset\mathbb{R}^2$ is the average length of its orthogonal projections. We prove that if $E$ is Ahlfors 1-regular and it has large Favard length, then it contains a big piece of a Lipschitz graph. This…
Verification methods based on SAT, SMT, and Theorem Proving often rely on proofs of unsatisfiability as a powerful tool to extract information in order to reduce the overall effort. For example a proof may be traversed to identify a minimal…
The permutation language $P_n$ consists of all words that are permutations of a fixed alphabet of size $n$. Using divide-and-conquer, we construct a regular expression $R_n$ that specifies $P_n$. We then give explicit bounds for the length…
Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with $n$ holes and any…
For the sake of reliability, the kernels of Interactive Theorem Provers (ITPs) are generally kept relatively small. On top of the kernel, additional symbols and inference rules are defined. This paper presents an analysis of how kernel…
We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of…
This paper deals with the three types of regular polytopes which exist in all dimensions -- regular simplices, cubes and regular cross-polytopes -- and their outer and inner radii. While the inner radii of regular simplices are well…
We give short and simple proofs of what seem to be folklore results: * the maximum cardinality of the intersection of a lattice cube with an affine subspace; * the minimum number of affine subspaces needed to cover a lattice cube.
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…
Primitive recursion, mu-recursion, universal object and universe theories, complexity controlled iteration, code evaluation, soundness, decidability, G\"odel incompleteness theorems, inconsistency provability for set theory, constructive…
In this paper, we analyze 2CNF formulas from the perspectives of Read-Once resolution (ROR) refutation schemes. We focus on two types of ROR refutations, viz., variable-once refutation and clause-once refutation. In the former, each…
This paper studies absolute retracts in congruence modular varieties of universal algebras. It is shown that every absolute retract with finite dimensional congruence lattice is a product of subdirectly irreducible algebras. Further, every…
In general, representations of interval orders may use an arbitrary set of interval lengths. We can define subclasses of interval orders by restricting the allowable lengths of intervals. Motivated by a recent paper of Keller, Trenk, and…
This work focuses on the length correction due to radiation effect of a duct discontinuity or at the surface of a perforated plate in the linear acoustic domain and at large wavelengths. Two results are obtained from the comparison of…
We consider possible reconstructions of a binary image of which the row and column sums are given. For any reconstruction we can define the length of the boundary of the image. In this paper we prove a new lower bound on the length of this…
After a Hessian computation, we quickly prove the 3D simplex mean width conjecture using classical methods. Then, we generalize some components to $d$ dimensions.