English
Related papers

Related papers: Embedding $FD(\omega)$ into $\mathcal{P}_s$ densel…

200 papers

We investigate the density of compactly supported smooth functions in the Sobolev space $W^{k,p}$ on complete Riemannian manifolds. In the first part of the paper, we extend to the full range $p\in [1,2]$ the most general results known in…

Differential Geometry · Mathematics 2024-10-15 Shouhei Honda , Luciano Mari , Michele Rimoldi , Giona Veronelli

Let $S$ be a finite set of primes. The $S$-part $[m]_S$ of a non-zero integer $m$ is the largest positive divisor of $m$ that is composed of primes from $S$. In 2013, Gross and Vincent proved that if $f(X)$ is a polynomial with integer…

Number Theory · Mathematics 2023-09-19 Yann Bugeaud , Jan-Hendrik Evertse , Kálmán Győry

We use the polynomial method of Guth and Katz to establish stronger and {\it more efficient} regularity and density theorems for such $k$-uniform hypergraphs $H=(P,E)$, where $P$ is a finite point set in ${\mathbb R}^d$, and the edge set…

Computational Geometry · Computer Science 2024-08-15 Natan Rubin

We study the Gibbs statistics of high-density hard-core configurations on a unit square lattice $\mathbb{Z}^2$, for a general Euclidean exclusion distance $D$. As a by-product, we solve the disk-packing problem on $\mathbb{Z}^2$ for disks…

Probability · Mathematics 2023-06-23 A. Mazel , I. Stuhl , Y. Suhov

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

Logic · Mathematics 2013-07-02 Rodney G. Downey , Carl G. Jockusch , Paul E. Schupp

Minkowski proved that any $n$-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt{n}$; in fact, there are $2^{\Omega(n)}$ such lattice vectors. Lattices whose minimum distances come close to…

Information Theory · Computer Science 2021-09-13 Ethan Mook , Chris Peikert

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

Complex Variables · Mathematics 2012-07-24 Anton Baranov , Harald Woracek

We prove in particular that, in a large class of dp-minimal theories including the p-adics, definable types are dense amongst non-forking types.

Logic · Mathematics 2014-07-02 Pierre Simon , Sergei Starchenko

We develop and test a spectral-density analysis method, based on the introduction of smeared energy kernels, to extract physical information from two-point correlation functions computed numerically in lattice field theory. We apply it to a…

Assume that $k$ is an algebraically closed field and $A$ is a finite-dimensional wild $k$-algebra. Recently, L. Gregory and M. Prest proved that in this case the width of the lattice of all pointed $A$-modules is undefined and hence there…

Representation Theory · Mathematics 2019-10-03 Grzegorz Pastuszak

The probability density function (PDF) associated with a given set of samples is approximated by a piecewise-linear polynomial constructed with respect to a binning of the sample space. The kernel functions are a compactly supported basis…

Numerical Analysis · Mathematics 2020-08-04 Giacomo Capodaglio , Max Gunzburger

Some properties of $m$-density points and density-degree functions are studied. Moreover the following main results are provided: \vskip2mm \begin{itemize} \item {\it Let $\lambda$ be a continuous differential form of degree $h$ in…

Functional Analysis · Mathematics 2024-07-18 Silvano Delladio

In a 1998 paper with H. Lakser, the authors proved that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite \emph{semimodular lattice}. Some ten years later, the first author and E. Knapp proved a…

Rings and Algebras · Mathematics 2019-08-13 G. Grätzer , E. T. Schmidt

We prove by means of a renormalization group method that in weakly interacting many-electron systems at half-filling on a periodic hyper-cubic lattice, the free energy density uniformly converges to an analytic function of the coupling…

Mathematical Physics · Physics 2016-12-19 Yohei Kashima

We consider sufficient conditions for the existence of $k$-th powers of Hamiltonian cycles in $n$-vertex graphs $G$ with minimum degree $\mu n$ for arbitrarily small $\mu>0$. About 20 years ago Koml\'os, Sark\"ozy, and Szemer\'edi resolved…

Combinatorics · Mathematics 2019-10-01 Oliver Ebsen , Giulia S. Maesaka , Christian Reiher , Mathias Schacht , Bjarne Schülke

In this work we deal with the preservation by $G_\delta$-refinements. We prove that for $\mathrm{SP}$-scattered spaces the metacompactness, paralindel\"ofness, metalindel\"ofness and linear lindel\"ofness are preserved by…

General Topology · Mathematics 2017-04-03 Robson A. Figueiredo

We prove that a compact space $K$ embeds into a $\sigma$-product of compact metrizable spaces ($\sigma$-product of intervals) if and only if $K$ is (strongly countable-dimensional) hereditarily metalindel\"of and every subspace of $K$ has a…

General Topology · Mathematics 2025-03-13 Antonio Avilés , Mikołaj Krupski

The representation theorem for odd or even involutive FLe-chains by bunches of layer groups, as discussed in [10], is redefined to demonstrate a more straightforward constructional relationship between odd or even involutive FLe-chains and…

Logic · Mathematics 2023-12-12 Sándor Jenei

For finite dimensional hermitean inner product spaces $V$, over $*$-fields $F$, and in the presence of orthogonal bases providing form elements in the prime subfield of $F$, we show that quantifier free definable relations in the subspace…

Logic · Mathematics 2019-05-20 Christian Herrmann , Martin Ziegler

It has long been known, since the classical work of (Arora, Karger, Karpinski, JCSS~99), that \MC\ admits a PTAS on dense graphs, and more generally, \kCSP\ admits a PTAS on "dense" instances with $\Omega(n^k)$ constraints. In this paper we…

Computational Complexity · Computer Science 2015-07-17 Dimitris Fotakis , Michael Lampis , Vangelis Th. Paschos