English
Related papers

Related papers: UPC condition with parameter for subanalytic sets

200 papers

The Constraint Satisfaction Problem (CSP) framework offers a simple and sound basis for representing and solving simple decision problems, without uncertainty. This paper is devoted to an extension of the CSP framework enabling us to deal…

Artificial Intelligence · Computer Science 2013-02-21 Helene Fargier , Jerome Lang , Roger Martin-Clouaire , Thomas Schiex

This paper gives a complete classification of conics in $PE_2(\mathbb{R})$. The classification has been made earlier (Reveruk [5]), but it showed to be incomplete and not possible to cite and use in further studies of properties of conics,…

Metric Geometry · Mathematics 2013-06-18 Jelena Beban-Brkić , Marija Šimić Horvath

We study boundary regularity for the normalized $p\mspace{1mu}$-parabolic equation in arbitrary bounded domains. Effros and Kazdan (Indiana Univ. Math. J. 20 (1970), 683-693) showed that the so-called tusk condition guarantees regularity…

Analysis of PDEs · Mathematics 2020-06-05 Anders Björn , Jana Björn , Mikko Parviainen

Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…

Computational Complexity · Computer Science 2015-02-06 Dorothea Baumeister , Felix Brandt , Felix Fischer , Jan Hoffmann , Joerg Rothe

The Parameterized Inapproximability Hypothesis (PIH) asserts that no fixed parameter tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the number of variables, from one where every assignment fails to…

Computational Complexity · Computer Science 2023-11-29 Venkatesan Guruswami , Bingkai Lin , Xuandi Ren , Yican Sun , Kewen Wu

Self-similar sets require a separation condition to admit a nice mathematical structure. The classical open set condition (OSC) is difficult to verify. Zerner proved that there is a positive and finite Hausdorff measure for a weaker…

Metric Geometry · Mathematics 2023-09-01 Christoph Bandt

In a recent paper \cite{CHR16}, Chandra, Hu and Rosalsky introduced the notion of a sequence of random variables being uniformly nonintegrable, and presented a list of interesting results on this uniform nonintegrability. In this note, we…

Probability · Mathematics 2016-06-08 Ze-Chun Hu , Xue Peng

Coherent configurations (CCs) are highly regular colorings of the set of ordered pairs of a "vertex set"; each color represents a "constituent digraph." CCs arise in the study of permutation groups, combinatorial structures such as…

Combinatorics · Mathematics 2016-08-26 Xiaorui Sun , John Wilmes

We prove that if a conditional expectation from a simple $C^*$-algebra onto its $C^*$-subalgebra satisfies the Pimsner-Popa inequality, there exists a quasi-basis. As an application, we establish the Galois correspondence for outer actions…

Operator Algebras · Mathematics 2007-05-23 Masaki Izumi

When data is sampled from an unknown subspace, principal component analysis (PCA) provides an effective way to estimate the subspace and hence reduce the dimension of the data. At the heart of PCA is the Eckart-Young-Mirsky theorem, which…

Machine Learning · Computer Science 2012-10-11 Yao-Liang Yu , Dale Schuurmans

We show that for any $t>1$, the set of unconditional convex bodies in $\mathbb{R}^n$ contains a $t$-separated subset of cardinality at least $\exp \exp (C(t) n)$. This implies that there exists an unconditional convex body in $\mathbb{R}^n$…

Metric Geometry · Mathematics 2015-08-21 Mark Rudelson

Alon, Shpilka and Umans considered the following version of usual sunflower-free subset: a subset $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ for $D>2$ is sunflower-free if for every distinct triple $x,y,z\in \mbox{$\cal F$}$ there exists…

Combinatorics · Mathematics 2018-05-14 Gábor Hegedűs

On a bounded smooth pseudoconvex domain in $\mathbb{C}^n$ with $n >2$, inspired by the compactness condition introduced by Yue Zhang, we present the new sufficient condition for the exact regularity of the $\overline\partial$-Neumann…

Complex Variables · Mathematics 2026-01-21 Qianyun Wang , Yuan Yuan , Xu Zhang

Using a well-ordering on the reals, one can prove there exists a partition of the three-dimensional Euclidean space into unit circles (PUC). We show that the converse does not hold: there exist models of $\mathsf{ZF}$ without a…

Logic · Mathematics 2025-01-07 Azul Fatalini

In the paper a new sufficient condition for the Aubin property to a class of parameterized variational systems is derived. In these systems the constraints depend both on the parameter as well as on the decision variable itself and they…

Optimization and Control · Mathematics 2018-10-31 Helmut Gfrerer , Jiri V. Outrata

Sufficient conditions on $A$, $B$, $p$, $b$ and $c$ are determined that will ensure the generalized Bessel functions ${u}_{p,b,c}$ satisfies the subordination ${u}_{p,b,c}(z) \prec (1+Az)/ (1+Bz)$. In particular this gives conditions for…

Complex Variables · Mathematics 2015-06-11 Saiful R. Mondal , Al Dhuain Mohammed

A number of attempts have been made to improve accuracy and/or scalability of the PC (Peter and Clark) algorithm, some well known (Buhlmann, et al., 2010; Kalisch and Buhlmann, 2007; 2008; Zhang, 2012, to give some examples). We add here…

Artificial Intelligence · Computer Science 2016-10-06 Joseph Ramsey

We prove a low characteristic counterpart to the main result in (Peluse, 2019), establishing power saving bounds for the polynomial Szemer\'{e}di theorem for certain families of polynomials. Namely, we show that if $P_1, \dots, P_m \in…

Number Theory · Mathematics 2023-03-03 Ethan Ackelsberg , Vitaly Bergelson

This is the report-version of a mini-series of two articles on the foundations of satisfiability of conjunctive normal forms with non-boolean variables, to appear in Fundamenta Informaticae, 2011. These two parts are here bundled in one…

Discrete Mathematics · Computer Science 2012-02-15 Oliver Kullmann

In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $ f(n) $ of parts of smaller diameter into which an arbitrary set of diameter 1 in…

Combinatorics · Mathematics 2025-08-21 Arthur Igorevich Bikeev , Andrei Mikhailovich Raigorodskii