English
Related papers

Related papers: On variables with few occurrences in conjunctive n…

200 papers

This article proves the existence and regularity of weak solutions for a class of mixed local-nonlocal problems with singular nonlinearities. We examine both the purely singular problem and perturbed singular problems. A central…

Analysis of PDEs · Mathematics 2025-02-27 Sanjit Biswas , Prashanta Garain

By well known results of probability theory, any sequence of random variables with bounded second moments has a subsequence satisfying the central limit theorem and the law of the iterated logarithm in a randomized form. In this paper we…

Probability · Mathematics 2017-07-28 I. Berkes , R. Tichy

Context-free grammars are not able to model cross-serial dependencies in natural languages. To overcome this issue, Seki et al. introduced a generalization called $m$-multiple context-free grammars ($m$-MCFGs), which deal with $m$-tuples of…

Formal Languages and Automata Theory · Computer Science 2021-03-17 Florian Lehner , Christian Lindorfer

Frankl's conjecture, also known as the union-closed sets conjecture, can be equivalently expressed in terms of intersection-closed set families by considering the complements of sets. It posits that any family of sets closed under…

Combinatorics · Mathematics 2025-04-21 Masahiro Hachimori , Kenji Kashiwabara

We study the minimum sets of plurisubharmonic functions with strictly positive Monge-Amp\`ere densities. We investigate the relationship between their Hausdorff dimension and the regularity of the function. Under suitable assumptions we…

Complex Variables · Mathematics 2017-06-20 Slawomir Dinew , Zywomir Dinew

In this paper we study functions with low influences on product probability spaces. The analysis of boolean functions with low influences has become a central problem in discrete Fourier analysis. It is motivated by fundamental questions…

Probability · Mathematics 2007-05-23 Elchanan Mossel , Ryan O'Donnell , Krzysztof Oleszkiewicz

This paper analyzes to what extent it is possible to efficiently reduce the number of clauses in NP-hard satisfiability problems, without changing the answer. Upper and lower bounds are established using the concept of kernelization.…

Computational Complexity · Computer Science 2019-07-01 Bart M. P. Jansen , Astrid Pieterse

Morphological tasks use large multi-lingual datasets that organize words into inflection tables, which then serve as training and evaluation data for various tasks. However, a closer inspection of these data reveals profound…

Computation and Language · Computer Science 2022-10-20 Omer Goldman , Reut Tsarfaty

The existence of least finite support is used throughout the subject of nominal sets. In this paper we give some Brouwerian counterexamples showing that constructively, least finite support does not always exist and in fact can be quite…

Logic · Mathematics 2017-02-07 Andrew Swan

In this paper we focus on providing sufficient conditions for some well-known stochastic orders in reliability but dealing with the discrete versions of them, filling a gap in the literature. In particular, we find conditions based on the…

Statistics Theory · Mathematics 2026-01-28 F. Belzunce , C. Martínez-Riquelme , M. Pereda

We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…

Computational Complexity · Computer Science 2024-07-17 David Gamarnik , Elchanan Mossel , Ilias Zadik

We consider the random $k$-SAT problem with $n$ variables, $m=m(n)$ clauses, and clause density $\alpha=\lim_{n\to\infty}m/n$ for $k=2,3$. It is known that if $\alpha$ is small enough, then the random $k$-SAT problem admits a solution with…

Probability · Mathematics 2025-04-17 Andreas Basse-O'Connor , Tobias Lindhardt Overgaard , Mette Skjøtt

In the context of proving lower bounds on proof space in k-DNF resolution, [Ben-Sasson and Nordstrom 2009] introduced the concept of minimally unsatisfiable sets of k-DNF formulas and proved that a minimally unsatisfiable k-DNF set with m…

Discrete Mathematics · Computer Science 2016-09-08 Jakob Nordström , Alexander Razborov

Minimal absent words (MAW) of a genomic sequence are subsequences that are absent themselves but the subwords of which are all present in the sequence. The characteristic distribution of genomic MAWs as a function of their length has been…

Genomics · Quantitative Biology 2016-05-04 Erik Aurell , Nicolas Innocenti , Hai-Jun-Zhou

In this paper, we study the regularity assumptions commonly adopted in bilevel optimization with constrained lower-level problems, including the linear independence constraint qualification, the strict complementary slackness condition, and…

Optimization and Control · Mathematics 2026-05-15 Xiaotian Jiang , Chang He , Mingyi Hong , Shuzhong Zhang

Let $Z(F)$ be the number of solutions of a random $k$-satisfiability formula $F$ with $n$ variables and clause density $\alpha$. Assume that the probability that $F$ is unsatisfiable is $O(1/\log(n)^{1+\e})$ for $\e>0$. We show that…

Discrete Mathematics · Computer Science 2010-06-23 Emmanuel Abbe , Andrea Montanari

Today, data analysts largely rely on intuition to determine whether missing or withheld rows of a dataset significantly affect their analyses. We propose a framework that can produce automatic contingency analysis, i.e., the range of values…

Databases · Computer Science 2020-04-09 Xi Liang , Zechao Shang , Aaron J. Elmore , Sanjay Krishnan , Michael J. Franklin

Let $V$ be a real algebraic variety with singularities and $f$ be a real polynomial non-negative on $V$. Assume that the regular locus of $V$ is dense in $V$ by the usual topology. Using Hironaka's resolution of singularities and…

Algebraic Geometry · Mathematics 2023-03-10 Ngoc Hoang Anh Mai

We show that in the $K$-sat model with $N$ variables and $\alpha N$ clauses, the expected ratio of the smallest number of unsatisfied clauses to the number of variables is $\alpha/2^K - \sqrt{\alpha} c_*(N)/2^K$ up to smaller order terms…

Probability · Mathematics 2018-03-28 Dmitry Panchenko

Frechet bounds of the 1-st kind for sets of events and its main properties are considered. The lemma on not more than two nonzero values of lower Frechet-bounds of the 1-st kind for a set of half-rare events is proved with the corollary on…

General Mathematics · Mathematics 2018-02-15 Oleg Yu. Vorobyev
‹ Prev 1 3 4 5 6 7 10 Next ›