English
Related papers

Related papers: There are Salem numbers of every trace

200 papers

Let $[n]=X_1\cup X_2\cup X_3$ be a partition with $\lfloor\frac{n}{3}\rfloor \leq |X_i|\leq \lceil\frac{n}{3}\rceil$ and define $\mathcal{G}=\{G\subset [n]\colon |G\cap X_i|\leq 1, 1\leq i\leq 3\}$. It is easy to check that the trace…

Combinatorics · Mathematics 2023-01-18 Peter Frankl , Jian Wang

It is well known that the zeros of orthogonal polynomials interlace. In this paper we study the case of multiple orthogonal polynomials. We recall known results and some recursion relations for multiple orthogonal polynomials. Our main…

Classical Analysis and ODEs · Mathematics 2013-10-04 Maciej Haneczok , Walter Van Assche

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

General Mathematics · Mathematics 2021-07-06 Nathan Thomas Provost

Alon and Shapira proved that every monotone class (closed under taking subgraphs) of undirected graphs is strongly testable, that is, under the promise that a given graph is either in the class or $\varepsilon$-far from it, there is a test…

Combinatorics · Mathematics 2024-09-25 Panna Tímea Fekete , Gábor Kun

We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…

Combinatorics · Mathematics 2017-05-30 Denis Chebikin , Richard Ehrenborg , Pavlo Pylyavskyy , Margaret Readdy

We give sufficient conditions under which a polyanalytic polynomial of degree $n$ has (i) at least one zero, and (ii) finitely many zeros. In the latter case, we prove that the number of zeros is bounded by $n^2$. We then show that for all…

Complex Variables · Mathematics 2024-06-14 Olivier Sète , Jan Zur

We compute the Coxeter polynomial of a family of Salem trees, and also the limit of the spectral radii of their Coxeter transformations as the number of their vertices tends to infinity. We also prove a relation about multiplicities of…

Spectral Theory · Mathematics 2015-09-30 Charalampos A. Evripidou

An attempt to come closer to a resolution of the Collatz conjecture is presented. The central idea is the formation of a tree consisting of positive odd numbers with number 1 as root. Functions for generating the tree from the root are…

Number Theory · Mathematics 2018-08-20 Kerstin Andersson

The purpose of this note is to extend in a simple and unified way the known results on interlacing of zeros of paraorthogonal polynomials on the unit circle. These polynomials can be regarded as the characteristic polynomials of any matrix…

Classical Analysis and ODEs · Mathematics 2017-06-20 K. Castillo , J. Petronilho

In this paper we attack the Erdos-Straus conjecture by means of the structure of its solutions, extending and improving the results of a previous paper. Using previous results and supported by the works of Elsholtz and Tao and Monks and…

Number Theory · Mathematics 2024-04-17 Miguel Angel Lopez

The trace norm of a matrix is the sum of its singular values. This paper presents results on the minimum trace norm $\psi_{n}\left( m\right) $ of $\left( 0,1\right) $-matrices of size $n\times n$ with exactly $m$ ones. It is shown that: (1)…

Combinatorics · Mathematics 2017-03-21 Vladimir Nikiforov , Natalia Agudelo

We give a necessary and sufficient condition on a positive compact operator $T$ for the existence of a singular trace (i.e. a trace vanishing on the finite rank operators) which takes a finite non-zero value on $T$. This generalizes…

funct-an · Mathematics 2008-02-03 S. Albeverio , D. Guido , A. Ponosov , S. Scarlatti

We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…

Algebraic Geometry · Mathematics 2007-05-23 Jean B. Lasserre

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

Number Theory · Mathematics 2019-08-23 Jitender Singh , Sanjeev Kumar

For every symmetrically normed ideal $\mathcal{E}$ of compact operators, we give a criterion for the existence of a continuous singular trace on $\mathcal{E}$. We also give a criterion for the existence of a continuous singular trace on…

Operator Algebras · Mathematics 2011-08-15 F. Sukochev , D. Zanin

We show that Connes' embedding conjecture on von Neumann algebras is equivalent to the existence of certain algebraic certificates for a polynomial in noncommuting variables to satisfy the following nonnegativity condition: The trace is…

Operator Algebras · Mathematics 2011-04-19 Igor Klep , Markus Schweighofer

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

Commutative Algebra · Mathematics 2018-01-18 Beata Hejmej

We study the space of traces associated with arbitrary full free products of unital, separable $C^*$-algebras. We show that, unless certain basic obstructions (which we fully characterize) occur, the space of traces always results in the…

Operator Algebras · Mathematics 2024-12-19 Adrian Ioana , Pieter Spaas , Itamar Vigdorovich

Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…

Numerical Analysis · Computer Science 2014-09-09 Bahman Kalantari
‹ Prev 1 3 4 5 6 7 10 Next ›