相关论文: A paradoxical decomposition of the real line

We consider the continued fraction digits as random variables measured with respect to Lebesgue measure. The logarithmically scaled and normalized fluctuation process of the digit sums converges strongly distributional to a random variable…

Let $P$ be a poset of size $2^k$ that has a greatest and a least element. We prove that, for sufficiently large $n$, the Boolean lattice $2^{[n]}$ can be partitioned into copies of $P$. This resolves a conjecture of Lonc.

This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…

The separation of two sets (or more specific of two cones) plays an important role in different fields of mathematics such as variational analysis, convex analysis, convex geometry, optimization. In the paper, we derive some new results for…

The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…

We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of $1+1/1080-\varepsilon$.

Ribbon decomposition is a way to obtain a surface with boundary (compact, not necessarily oriented) from a collection of disks by joining them with narrow ribbons attached to segments of the boundary. Counting ribbon decompositions gives…

We study lines on smooth cubic surfaces over the field of $p$-adic numbers, from a theoretical and computational point of view. Segre showed that the possible counts of such lines are $0,1,2,3,5,7,9,15$ or $27$. We show that each of these…

Renling Jin proved that if A and B are two subsets of the natural numbers with positive Banach density, then A+B is piecewise syndetic. In this paper, we prove that, under various assumptions on positive lower or upper densities of A and B,…

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…

Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. We present and discuss the separation problem…

We give explicit formulas to compute most of the decomposition numbers of reductions modulo 2 of irreducible spin representations of symmetric groups indexed by partitions with at most 2 parts. In many of the still open cases small upper…

We investigate models of relations over a bounded continuous segment of real numbers, along with the natural linear order over the reals being provided as a "hard-coded" relation. This paper presents a generalization of a lemma from…

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

In this note, given a regular Courant algebroid, we compute its group of automorphisms relative to a dissection. We also propose an infinitesimal version and recover examples of the literature.

Given a positive linear combination of five (respectively seven) cosines, where the angles are positive and sum to pi, the aim of this article is to express the sharp bound of the combination as a Positive Real Fraction in the coefficients…

We prove that the free additive convolution of two Borel probability measures supported on the real line can have a component that is singular continuous with respect to the Lebesgue measure on the real line only if one of the two measures…

We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…