English
Related papers

Related papers: $B'$

200 papers

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

Algebraic Geometry · Mathematics 2007-05-23 Alexey Glutsyuk

We give a partial answer to a question attributed to Chris Miller on algebraic values of certain transcendental functions of order less than one. We obtain C(logH)^n bounds for the number of algebraic points of height at most H on certain…

Number Theory · Mathematics 2019-07-25 Taboka Prince Chalebgwa

If n points B_1,---,B_n$ in the standard simplex \Delta_n are affinely independent, then they can span an (n-1)-simplex denoted by \Lambda=Con(B_1,---,B_n). Here \Lambda corresponds to an n*n matrix [\Lambda] whose columns are B_1,---,B_n.…

Algebraic Geometry · Mathematics 2012-09-19 Yong Yao , Jia Xu , Jingzhong Zhang

We study the behavior of the bilinear Hilbert transform $\mathrm{BHT}$ at the boundary of the known boundedness region $\mathcal H$. A sample of our results is the estimate $| \langle\mathrm{BHT}(f_1,f_2),f_3 \rangle | \leq C…

Classical Analysis and ODEs · Mathematics 2014-03-25 Francesco Di Plinio , Christoph Thiele

Given a finite set of bases $b_1$, $b_2$, \dots, $b_r$ (integers greater than $1$), a multi-base representation of an integer~$n$ is a sum with summands $db_1^{\alpha_1}b_2^{\alpha_2} \cdots b_r^{\alpha_r}$, where the $\alpha_j$ are…

Number Theory · Mathematics 2019-07-15 Daniel Krenn , Vorapong Suppakitpaisarn , Stephan Wagner

In this paper, we improve the results in the author's previous paper \cite{Usu22}, which deals with the quantitative problem on Littlewood's conjecture. We show that, for any $0<\gamma<1$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set…

Number Theory · Mathematics 2024-04-23 Shunsuke Usuki

Let $G$ be an abelian group. A set $A \subset G$ is a \emph{$B_k^+$-set} if whenever $a_1 + \dots + a_k = b_1 + \dots + b_k$ with $a_i, b_j \in A$ there is an $i$ and a $j$ such that $a_i = b_j$. If $A$ is a $B_k$-set then it is also a…

Combinatorics · Mathematics 2013-06-21 Craig Timmons

A set of integers $S \subset \mathbb{N}$ is an $\alpha$-strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on $\alpha$, more specifically if $| (x+w) - (y+z) | \geq \max \{…

Combinatorics · Mathematics 2019-12-09 David Fabian , Juanjo Rué , Christoph Spiegel

We prove the following two results. \begin{enumerate} \item Let $\mathcal{A}$ be a unital commutative C*-algebra and $\mathcal{A}^d$ be the standard Hilbert C*-module over $\mathcal{A}$. Let $n\geq d$. If $\{\tau_j\}_{j=1}^n$ is any…

Operator Algebras · Mathematics 2022-01-04 K. Mahesh Krishna

Let $ \mathbb{B}(\mathscr{H})$ represent the $C^*$-algebra, which consists of all bounded linear operators on $\mathscr{H},$ and let $N ( .) $ be a norm on $ \mathbb{B}(\mathscr{H})$. We define a norm $w_{(N,e)} (. , . )$ on $…

Functional Analysis · Mathematics 2024-09-05 Suvendu Jana

If $P(z)$ be a polynomial of degree at most $n$ which does not vanish in $|z| < 1$, it was recently formulated by Shah and Liman \cite[\textit{Integral estimates for the family of $B$-operators, Operators and Matrices,} \textbf{5}(2011), 79…

Complex Variables · Mathematics 2013-06-05 N. A. Rather , Suhail Gulzar

Let $R^h$ denote the polynomial ring in variables $x_1,\,\ldots,\, x_h$ over a specified field $K$. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with $x_1 > \cdots > x_h$. Given a fixed…

Commutative Algebra · Mathematics 2020-03-03 Tigran Ananyan , Melvin Hochster

We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…

Representation Theory · Mathematics 2024-11-25 Darius Dramburg , Oleksandra Gasanova

In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…

Number Theory · Mathematics 2022-06-24 Stephan Baier , Sudhir Pujahari

Let $H_n =\sum\limits_{k=1}^n \frac{1}{k}$ be the $n$-th harmonic number. Euler extended it to complex arguments and defined $H_r$ for any complex number $r$ except for the negative integers. In this paper, we give a new proof of the…

Number Theory · Mathematics 2018-10-24 Tapas Chatterjee , Sonika Dhillon

Suppose that c is a linear operator acting on an n-dimensional complex Hilbert Space H, and let tau denote the normalized trace on B(H). Set b_1 = (c+c*)/2 and b_2 = (c-c*)/2i, and write B for the the spectral scale of {b_1, b_2} with…

Rings and Algebras · Mathematics 2007-05-23 Charles A. Akemann , Joel Anderson

A classic result by Cook, Gerards, Schrijver, and Tardos provides an upper bound of $n \Delta$ on the proximity of optimal solutions of an Integer Linear Programming problem and its standard linear relaxation. In this bound, $n$ is the…

Optimization and Control · Mathematics 2021-04-16 Alberto Del Pia , Mingchen Ma

Professor Georges Rhin considers a nonzero algebraic integer $\a$ with conjugates $\a_1=\a, \ldots, \a_d$ and asks what can be said about $\d \sum_{ | \a_i | >1} | \a_i |$, that we denote ${\rm{R}}(\a)$. If $\a$ is supposed to be a totally…

Number Theory · Mathematics 2024-01-24 V. Flammang

For $k\geq 2$, we give a detailed exposition of the superior $k$-highly composite numbers. We then consider the function \[f_k(n)=\frac{\log d_k(n)\log\log n}{\log k\log n},\quad n\geq 3\] which has a maximum value $\lambda(k)$ at a…

Number Theory · Mathematics 2025-11-25 Lee-Peng Teo

We present the first linear lower bound for the number of bits required to be accessed in the worst case to increment an integer in an arbitrary space- optimal binary representation. The best previously known lower bound was logarithmic. It…

Computational Complexity · Computer Science 2017-02-16 M. Raskin
‹ Prev 1 3 4 5 6 7 10 Next ›