English
Related papers

Related papers: Nil Bohr$_0$-sets, Poincar\'e recurrence and gener…

200 papers

In this paper, we consider the pointwise convergence for a class of generalized Schr\"{o}dinger operators with suitable perturbations, and convergence rate for a class of generalized Schr\"{o}dinger operators with polynomial growth. We show…

Classical Analysis and ODEs · Mathematics 2021-08-31 Wenjuan Li , Huiju Wang

H.Furstenberg and E.Glasner proved that for an arbitrary $k\in\mathbb{N}$, any piecewise syndetic set of integers contains a $k$-term arithmetic progression and the collection of such progressions is itself piecewise syndetic in…

Combinatorics · Mathematics 2024-08-22 Dibyendu De , Pintu Debnath

Via a generalization of the pseudospectral method for numerical solution of differential equations, a family of nonlinear algebraic identities satisfied by the zeros of a wide class of orthogonal polynomials is derived. The generalization…

Classical Analysis and ODEs · Mathematics 2018-06-19 Oksana Bihun , Clark Mourning

We introduce the notion of generalized bialgebra, which includes the classical notion of bialgebra (Hopf algebra) and many others. We prove that, under some mild conditions, a connected generalized bialgebra is completely determined by its…

Quantum Algebra · Mathematics 2008-12-16 Jean-Louis Loday

The concept of sums of nonnegative circuit polynomials (SONC) was recently introduced as a new certificate of nonnegativity especially for sparse polynomials. In this paper, we explore the relationship between nonnegative polynomials and…

Combinatorics · Mathematics 2021-04-06 Jie Wang

The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…

Rings and Algebras · Mathematics 2022-01-11 Rabigul Tuniyaz , Gulshadam Yunus

Let $S \subseteq \mathbb{N}$ have the property that for each $k \in S$ the set $(S - k) \cap \mathbb{N} \setminus S$ has asymptotic density $0$. We prove that there exists a basic sequence $Q$ where the set of numbers $Q$-normal of all…

Number Theory · Mathematics 2017-10-11 Dylan Airey , Bill Mance

We review some recent results on random polynomials and their generalizations in complex and symplectic geometry. The main theme is the universality of statistics of zeros and critical points of (generalized) polynomials of degree $N$ on…

Mathematical Physics · Physics 2007-05-23 Steve Zelditch

We show that if a big set of integer points in [0,N]^d, d>1, occupies few residue classes mod p for many primes p, then it must essentially lie in the solution set of some polynomial equation of low degree. This answers a question of…

Number Theory · Mathematics 2019-12-19 Miguel N. Walsh

Let $(X, \mathcal{B},\mu,T)$ be an ergodic measure preserving system, $A \in \mathcal{B}$ and $\epsilon>0$. We study the largeness of sets of the form \begin{equation*} \begin{split} S = \left\{ n\in\mathbb{N}\colon\mu(A\cap…

Dynamical Systems · Mathematics 2019-08-06 Sebastián Donoso , Anh N. Le , Joel Moreira , Wenbo Sun

Let $(S_0,S_1,...)$ be a supermartingale relative to a nondecreasing sequence of $\sigma$-algebras $H_{\le0},H_{\le1},...$, with $S_0\le0$ almost surely (a.s.) and differences $X_i:=S_i-S_{i-1}$. Suppose that $X_i\le d$ and $\mathsf…

Probability · Mathematics 2007-05-23 Iosif Pinelis

In this study, we explore multiple higher-order pole solutions in spinor Bose--Einstein condensates. These solutions are associated with different pairs of higher-order poles of the transmission coefficient in the inverse scattering…

Exactly Solvable and Integrable Systems · Physics 2024-02-14 Huan Liu , Jing Shen , Xianguo Geng

There are natural polynomial invariants of polytopes and lattice polytopes coming from enumerative combinatorics and Ehrhart theory, namely the $h$- and $h^*$-polynomials, respectively. In this paper, we study their generalization to…

Combinatorics · Mathematics 2021-10-05 Eric Katz , Alan Stapledon

Generalized permutahedra are the polytopes obtained from the permutahedron by changing the edge lengths while preserving the edge directions, possibly identifying vertices along the way. We introduce a "lifting" construction for these…

Combinatorics · Mathematics 2013-02-25 Federico Ardila , Jeffrey Doker

By using the work of Frantzikinakis and Wierdl, we can see that for all $d\in\mathbb{N}$, $\alpha\in(d,d+1)$, and integers $k\ge d+2$ and $r\ge1$, there exist infinitely many $n\in\mathbb{N}$ such that the sequence…

Number Theory · Mathematics 2021-02-16 Kota Saito , Yuuya Yoshida

We study a surprising phenomenon related to the representation of a cloud of data points using polynomials. We start with the previously unnoticed empirical observation that, given a collection (a cloud) of data points, the sublevel sets of…

Machine Learning · Computer Science 2016-06-15 Jean-Bernard Lasserre , Edouard Pauwels

We prove that supports of non-symmetric Macdonald polynomials are $M$-convex. As a consequence, we resolve a 2019 conjecture of Monical, Tokcan, and Yong that they have the saturated Newton polytope property. As a corollary we show that…

Combinatorics · Mathematics 2026-03-24 Milo Bechtloff Weising , Alexander E. Black

Let $S$ be a family of sequences of positive numbers that decrease to 0, let $X$ be a metric space and $A \subset X$. $A$ is said to be $S$-dominated if, for every $s\in S$, a countable cover $\{E_n\}$ of $E$ can be found such that $diam…

Classical Analysis and ODEs · Mathematics 2026-03-23 Ondřej Zindulka , Piotr Nowakowski

The polytope subalgebra of deformations of a zonotope can be endowed with the structure of a module over the Tits algebra of the corresponding hyperplane arrangement. We explore this construction and find relations between statistics on…

Combinatorics · Mathematics 2025-02-14 Jose Bastidas

We investigate how efficiently a well-studied family of domination-type problems can be solved on bounded-treewidth graphs. For sets $\sigma,\rho$ of non-negative integers, a $(\sigma,\rho)$-set of a graph $G$ is a set $S$ of vertices such…

Computational Complexity · Computer Science 2025-04-22 Jacob Focke , Dániel Marx , Fionn Mc Inerney , Daniel Neuen , Govind S. Sankar , Philipp Schepper , Philip Wellnitz
‹ Prev 1 8 9 10 Next ›