Related papers: Almost $k$-union closed set systems

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

Let $K$ be a number field, let $X$ be a smooth integral variety over $K$, and assume that there exists a finite set of finite places $S$ of $K$ such that the $S$-integral points on $X$ are dense. Then the combined conjectures of Campana and…

Combining the approaches made in works with Galeotti and Passmann, we define and study a notion of "almost sure" realizability with parameter-free ordinal Turing machines (OTMs). In particular, we show that, in contrast to the classical…

A combinatorial principle CECA is formulated and its equivalence with GCH+ certain weakenings of Box_lambda for singular lambda is proved. CECA is used to show that certain ``almost point- < tau'' families can be refined to point- < tau…

The goal of this work is to prove a new sure upper bound in a setting that can be thought of as a simplified function field analogue. This result is comparable to a recent result of the author concerning almost sure upper bound of random…

In this paper we show that the convolution product of "almost characters" of a connected reductive group over a finite field is given by "structure constants" whose leading coefficients can be interpreted in K-theoretic terms and in…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

We study almost automorphic solutions of the discrete delayed neutral dynamic system% \[ x(t+1)=A(t)x(t)+\Delta Q(t,x(t-g(t)))+G(t,x(t),x(t-g(t))) \] by means of a fixed point theorem due to Krasnoselskii. Using discrete variant of…

The almost sure convergence of ergodic averages in Birkhoff's pointwise ergodic theorem is known to fail in the finitely additive setting. We introduce a natural reformulation of almost sure convergence suitable for finitely additive…

We present two stable mergesort variants, "peeksort" and "powersort", that exploit existing runs and find nearly-optimal merging orders with practically negligible overhead. Previous methods either require substantial effort for determining…

We presented here a refinement of Hermite-Hadamard inequality as a linear combination of its end-points. The problem of best possible constants is closely connected with well known Simpson's rule in numerical integration. It is solved here…

A family of sets F is said to be union-closed if A \cup B is in F for every A and B in F. Frankl's conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the…

In this paper, we introduce the notion of the universe, induced communities, and cells with their corresponding spots. Using this language, we formulate and prove the union close set conjecture by showing that for any finite universe…

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - \epsilon$, assuming the Unique…

In [B] Beiglb\"ock gave a Multidimension Central sets theorem. Recently, [GP] extended this result for polynomials. They proved the Multidimensional Polynomial Central sets theorem. Earlier, Hindman and Leader introduced the near zero…

We prove that any stable method for resolving the Gibbs phenomenon - that is, recovering high-order accuracy from the first $m$ Fourier coefficients of an analytic and nonperiodic function - can converge at best root-exponentially fast in…

We revisit the Kahn-Kalai conjecture, recently proved in striking fashion by Park and Pham, and present a slightly reformulated simple proof which has a few advantages: (1) it works for non-uniform product measures, (2) it gives…

Let G be a graph with vertices V and edges E. Let F be the union-closed family of sets generated by E. Then F is the family of subsets of V without isolated points. Theorem: There is an edge e belongs to E such that |{U belongs to F | e…

In this paper we prove that if (u, K) is an almost-minimizer of the Griffith functional and K is $\epsilon$-close to a plane in some ball B $\subset$ R N while separating the ball B in two big parts, then K is C 1,$\alpha$ in a slightly…

We resolve a long-standing open question, about the existence of a constant-factor approximation algorithm for the average-case \textsc{Decision Tree} problem with uniform probability distribution over the hypotheses. We answer the question…