English
Related papers

Related papers: A note on linear forms in two logarithms: the argu…

200 papers

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

Representation Theory · Mathematics 2025-07-14 Viktor Chust , Flávio U. Coelho

In this note, we describe some desingularizations of some subvarieties of the cartesian powers of a semisimple Lie algebra of finite dimension.

Representation Theory · Mathematics 2012-10-01 Mouchira Zaiter

In this note one tries to venture into a study of some notions, in the context of a (unital) normed algebra, in particular the algebra of operators on a Hilbert space. Namely, one considers ``moving norms'', i.e.\ norming an element minus a…

Functional Analysis · Mathematics 2022-11-02 Eliahu Levy

In this paper we continue the investigation of a real number object, i.e., an object representing the real numbers, in categories of relations. Our axiomatization is based on a relation algebraic version of Tarski's axioms of the real…

Logic · Mathematics 2026-01-14 Michael Winter

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

We present a necessary and sufficient condition for a root greater than unity of a monic reciprocal polynomial of an even degree at least four, with integer coefficients, to be a Salem number. We determine the probability of fulfillment the…

Number Theory · Mathematics 2019-09-24 Dragan Stankov

We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.

Algebraic Geometry · Mathematics 2015-08-24 Hwangrae Lee

We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, "the letter $a$ appears between…

Logic in Computer Science · Computer Science 2023-06-22 Andreas Krebs , Kamal Lodaya , Paritosh K. Pandya , Howard Straubing

Suppose that G is a finite group and A is a subset of G such that 1_A has algebra norm at most M. Then 1_A is a plus/minus sum of at most L cosets of subgroups of G, and L can be taken to be triply tower in O(M). This is a quantitative…

Classical Analysis and ODEs · Mathematics 2012-12-04 Tom Sanders

To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…

Quantum Algebra · Mathematics 2009-11-11 Israel Gelfand , Sergei Gelfand , Vladimir Retakh , Robert Lee Wilson

In this note it is shown that two key results on transcendental singularities for meromorphic functions of finite lower order have refinements which hold under the weaker hypothesis that the logarithmic derivative has finite lower order.

Complex Variables · Mathematics 2018-07-26 J. K. Langley

Let $S \subset \mathbb{N}_0$ be a numerical monoid and let $\mathcal P_{\mathrm{fin}} (S)$, resp $\mathcal P_{\mathrm{fin},0}(S)$, denote the power monoid, resp. the restricted power monoid, of $S$, that is the set of all finite nonempty…

Number Theory · Mathematics 2023-01-30 Pierre-Yves Bienvenu , Alfred Geroldinger

We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least as strong as Frege---yielding a semantic way to define a…

Computational Complexity · Computer Science 2010-08-03 Iddo Tzameret

For a given positive integers $m$ and $\ell$, we give a complete list of positive integers $n$ for which their exist $m$th roots of unity $x_1,\dots,x_n \in \mathbb{C}$ such that $x_1^{\ell} + \cdots + x_n^{\ell}=0$. This extends the…

Number Theory · Mathematics 2016-03-04 Neeraj Kumar , K. Senthil Kumar

We revisit a subexponential bound for the $abc$ conjecture due to the first author, and we establish a variation of it using linear forms in logarithms. As an application, we prove an unconditional subexponential bound towards the $4$-terms…

Number Theory · Mathematics 2024-06-10 Hector Pasten , Rocío Sepúlveda-Manzo

This note presents a simple, universal closed form for the powers of any square matrix. A diligent search of the internet gave no indication that the form is known.

Combinatorics · Mathematics 2015-12-02 Walter Shur

In this note, we give a linear-size translation from formulas of first-order logic into equations of the calculus of relations preserving validity and finite validity. Our translation also gives a linear-size conservative reduction from…

Logic in Computer Science · Computer Science 2025-12-31 Yoshiki Nakamura

We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…

Logic in Computer Science · Computer Science 2025-10-31 Michael Benedikt , Chia-Hsuan Lu , Tony Tan

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

Number Theory · Mathematics 2017-10-16 Andrei K. Svinin , Svetlana V. Svinina

We give upper bounds on the size of the gap between a non-zero constant term and the next non-zero Fourier coefficient of an entire level two modular form. We give upper bounds for the minimum positive integer represented by a level two…

Number Theory · Mathematics 2015-06-26 Barry Brent