English
Related papers

Related papers: Integers in the open string

200 papers

Let $T$ be an absolutely continuous polynomially bounded operator, and let $\theta$ be a singular inner function. It is shown that if $\theta(T)$ is invertible and some additional conditions are fulfilled, then $T$ has nontrivial…

Functional Analysis · Mathematics 2019-12-17 Maria F. Gamal'

In paper on a classification of Lehmer triples, Juricevic conjectured that there are infinitely many primes of special form. We disprove one of his conjectures and consider the other one.

Number Theory · Mathematics 2010-04-09 Yu Tsumura

A famous conjecture of Gy\'arf\'as and Sumner states for any tree $T$ and integer $k$, if the chromatic number of a graph is large enough, either the graph contains a clique of size $k$ or it contains $T$ as an induced subgraph. We discuss…

Traces of singular moduli were introduced and studied by Zagier in 1998. Being simultaneously the (traces of) values of a modular function ($j$-invariant) and Fourier coefficients of modular forms - which constitutes Zagier's duality -…

Number Theory · Mathematics 2026-02-24 Pavel Guerzhoy

We determine the order of magnitude of H(x,y,z), the number of integers n\le x having a divisor in (y,z], for all x,y and z. We also study H_r(x,y,z), the number of integers n\le x having exactly r divisors in (y,z]. When r=1 we establish…

Number Theory · Mathematics 2008-11-06 Kevin Ford

Let $F(x)$ be an irreducible polynomial with integer coefficients and degree at least 2. For $x\ge z\ge y\ge 2$, denote by $H_F(x, y, z)$ the number of integers $n\le x$ such that $F(n)$ has at least one divisor $d$ with $y<d\le z$. We…

Number Theory · Mathematics 2022-07-05 Kevin Ford , Guoyou Qian

The Collatz conjecture can be stated in terms of the reduced Collatz function R(x) = (3x+1)/2^m (where 2^m is the larger power of 2 that divides 3x+1). The conjecture is: Starting from any odd positive integer and repeating R(x) we…

Number Theory · Mathematics 2017-03-14 Livio Colussi

In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal class contains an integral ideal with a small enough non-zero…

Number Theory · Mathematics 2021-11-02 Daniël M. H. van Gent

Let c^{k,l}(n) be the number of compositions (ordered partitions) of the integer n whose Ferrers diagram fits inside a k-by-l rectangle. The purpose of this note is to give a simple, algebraic proof of a conjecture of Vatter that the…

Combinatorics · Mathematics 2007-07-10 Bruce E. Sagan

We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…

Rings and Algebras · Mathematics 2018-11-12 Tim Boykett

We present a bialternant formula for odd symplectic characters, which are the characters of indecomposable modules of odd symplectic groups introduced by R. Proctor. As an application, we give a linear algebraic proof to an odd symplectic…

Combinatorics · Mathematics 2021-02-08 Soichi Okada

We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…

Logic · Mathematics 2018-08-16 Vladimir Kanovei , Vassily Lyubetsky

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…

Applications · Statistics 2016-12-20 Roger Bilisoly

We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and…

Combinatorics · Mathematics 2019-02-05 Ondřej Turek , Dardo Goyeneche

We establish an effective version of the Andr\'e-Oort conjecture for linear subspaces of $Y(1)^n_{\mathbb{C}} \approx \mathbb{A}_{\mathbb{C}}^n$. Apart from the trivial examples provided by weakly special subvarieties, this yields the first…

Number Theory · Mathematics 2017-12-13 Yuri Bilu , Lars Kühne

Let H be an infinite-dimensional Taft algebra over an algebraically closed field k of characteristic 0. We find all the simple Yetter-Drinfeld modules V over H, and classifies those V with B(V) is finite-dimensional.

Quantum Algebra · Mathematics 2025-10-01 Xiangjun Zhen , Gongxiang Liu , Jing Yu

Let t be any integer and fix an odd prime ell. Let Phi(x) = T_ell^n(x)-t denote the n-fold composition of the Chebyshev polynomial of degree ell shifted by t. If this polynomial is irreducible, let K = bbq(theta), where theta is a root of…

Number Theory · Mathematics 2013-06-10 Thomas Alden Gassert

RO*-algebras are defined and studied. For RO*-algebra T, using properties of partial order, it is established that the set of bounded elements can be endowed with C*-norm. The structure of commutative subalgebras of T is considered and the…

Operator Algebras · Mathematics 2010-12-24 Dmitry Sh. Goldstein , Alexander A. Katz , Roman Sklyar

Erd\H{o}s first introduced the idea of covering systems in 1950. Since then, much of the work in this area has concentrated on identifying covering systems that meet specific conditions on their moduli. Among the central open problems in…

A collection $B$ of patterns is called inversion monotone if $\mathrm{av}_n^k(B)$, the number of $B$-avoiding permutations of length $n$ with $k$ inversions, is weakly increasing in $n$ for any fixed $k$. In 2012, Claesson, Jel\'inek and…

Combinatorics · Mathematics 2026-04-02 Anders Claesson , Svante Linusson , Henning Ulfarsson , Emil Verkama
‹ Prev 1 4 5 6 7 8 10 Next ›