English
Related papers

Related papers: Low-like basis theorems for Ramsey's theorem for p…

200 papers

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

Commutative Algebra · Mathematics 2011-05-18 G. -M. Greuel , F. Seelisch , O. Wienand

Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…

Symbolic Computation · Computer Science 2014-06-26 Jean-Charles Faugere , Pierre-Jean Spaenlehauer , Jules Svartz

The purpose of this paper is to introduce a new class of singular integral operators in the Dunkl setting involving both the Euclidean metric and the Dunkl metric. Then we provide the $T1$ theorem, the criterion for the boundedness on $L^2$…

Classical Analysis and ODEs · Mathematics 2022-04-06 Chaoqian Tan , Yanchang Han , Yongsheng Han , Ming-Yi Lee , Ji Li

We report on the performance of Lagrangian perturbation theory up to the second order for the standard cold dark matter (SCDM) and broken scale invariance (BSI) scenarios. We normalize both models to the COBE data, the BSI model serves as…

Astrophysics · Physics 2007-05-23 A. G. Weiss , S. Gottloeber , T. Buchert

In this paper we give a new proof of the Ne\v{s}et\v{r}il-R\"odl Theorem, a deep result of discrete mathematics which is one of the cornerstones of the structural Ramsey theory. In contrast to the well-known proofs which employ intricate…

Category Theory · Mathematics 2017-08-08 Dragan Masulovic

Given a domain above a Lipschitz graph, we establish solvability results for strongly elliptic second-order systems in divergence-form, allowed to have lower-order (drift) terms, with $L^p$-boundary data for $p$ near $2$ (more precisely, in…

Analysis of PDEs · Mathematics 2020-06-25 Martin Dindoš , Marius Mitrea , Sukjung Hwang

Let $\mathsf{TT}^1$ be the combinatorial principle stating that every finite coloring of the infinite full binary tree has a homogeneous isomorphic subtree. Let $\mathsf{RT}^2_2$ and $\mathsf{WKL}_0$ denote respectively the principles of…

Logic · Mathematics 2021-10-13 Chitat Chong , Wei Wang , Yue Yang

We consider N-body problems with homogeneous potential $1/r^{2\kappa}$ where $\kappa\in(0,1)$, including the Newtonian case ($\kappa=1/2$). Given $R>0$ and $T>0$, we find a uniform upper bound for the minimal action of paths binding in time…

Dynamical Systems · Mathematics 2015-02-24 Ezequiel Maderna

The main problem in the Hamiltonian formulation of Lattice Gauge Theories is the determination of an appropriate basis avoiding the over-completeness arising from Mandelstam relations. We short-cut this problem using Harmonic analysis on…

High Energy Physics - Lattice · Physics 2015-06-25 G. Burgio , R. De Pietri , H. A. Morales-Tecotl , L. F. Urrutia , J. D. Vergara

This paper concerns about the weak unique continuation property of solutions of a general system of differential equation/inequality with a second order strongly elliptic system as its leading part. We put not only some natural assumption…

Analysis of PDEs · Mathematics 2015-05-19 N. Honda , C. -L. Lin , G. Nakamura , S. Sasayama

A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a…

Combinatorics · Mathematics 2013-01-03 David Conlon , Jacob Fox , János Pach , Benny Sudakov , Andrew Suk

We give a short, self-contained, and elementary proof of the strong law of large numbers under a power law decay hypothesis for joint second moments. The result is related to the classical one by Lyons. However, we also provide a rate of…

Probability · Mathematics 2019-11-18 Abdelmalek Abdesselam

We prove a model theoretic Baire category theorem for $\tilde\tau_{low}^f$-sets in a countable simple theory in which the extension property is first-order and show some of its applications. We also prove a trichotomy for minimal types in…

Logic · Mathematics 2013-11-19 Ziv Shami

A low-order nonconforming finite element discretization of a smooth de Rham complex starting from the $H^2$ space in three dimensions is proposed, involving an $H^2$-nonconforming finite element space, a new tangentially continuous…

Numerical Analysis · Mathematics 2025-12-05 Xuewei Cui , Xuehai Huang

While an explicit basis is common in the study of Euclidean spaces, it is usually implied in the study of inertial relativistic systems. There are some conceptual advantages to including the basis in the study of special relativistic…

Classical Physics · Physics 2011-04-27 Peeter Joot

One of the main lines of research in algorithmic randomness is that of lowness notions. Given a randomness notion R, we ask for which sequences A does relativization to A leave R unchanged (i.e., R^A = R)? Such sequences are call low for R.…

Logic · Mathematics 2013-03-21 Laurent Bienvenu , Joseph S. Miller

We define a collection of topological Ramsey spaces consisting of equivalence relations on $\omega$ with the property that the minimal representatives of the equivalence classes alternate according to a fixed partition of $\omega$. To prove…

Logic · Mathematics 2021-12-14 Jamal K. Kawach , Stevo Todorcevic

The convergence rates results in $\ell^1$-regularization when the sparsity assumption is narrowly missed, presented by Burger et al. (2013 Inverse Problems 29 025013), are based on a crucial condition which requires that all basis elements…

Numerical Analysis · Mathematics 2015-08-05 Stephan W. Anzengruber , Bernd Hofmann , Ronny Ramlau

In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…

Combinatorics · Mathematics 2024-07-31 Matthew Baker , Oliver Lorscheid , Tianyi Zhang

In 1952, J.H.Braun claimed to have established a formula giving a lower bound for certain partitions of sets of integers into weakly sum-free classes. However, no proof or supporting construction was published at that time. In today's…

Combinatorics · Mathematics 2020-12-08 Fred Rowley