English
Related papers

Related papers: An Automatic Method for Generating Symbolic Expres…

200 papers

The main purpose and motivation of this article is to create a linear transformation on the polynomial ring of rational numbers. A matrix representation of this linear transformation based on standard fundamentals will be given. For some…

General Mathematics · Mathematics 2024-06-14 Ezgi Polat , Yilmaz Simsek

Spectral decomposition of matrices is a recurring and important task in applied mathematics, physics and engineering. Many application problems require the consideration of matrices of size three with spectral decomposition over the real…

Numerical Analysis · Mathematics 2021-11-04 Michal Habera , Andreas Zilian

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

Algebraic Geometry · Mathematics 2019-01-09 Robert Granger

We study the forward orbit of the critical point for polynomials of the form $f_c=z^2+c$ defined over $\mathbb{Z}_p$. Hubbard trees capture the dynamical behavior for such maps with finite critical orbit in $\mathbb{C}$. We suggest a notion…

Number Theory · Mathematics 2016-03-15 Cara Mullen

We show how to convert the generating series of interpolated multiple zeta values, or multiple $t$ values, with repeating blocks of length 1 into hypergeometric series. Then we invoke creative telescoping on their generating functions, in…

Number Theory · Mathematics 2024-04-26 Kam Cheong Au , Steven Charlton

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

Commutative Algebra · Mathematics 2024-08-07 Martin Kreuzer , Florian Walsh

The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…

Symbolic Computation · Computer Science 2007-05-23 Alina Andreica

In the convergence analysis of numerical methods for solving partial differential equations (such as finite element methods) one arrives at certain generalized eigenvalue problems, whose maximal eigenvalues need to be estimated as…

Symbolic Computation · Computer Science 2016-06-21 Christoph Koutschan , Martin Neumüller , Cristian-Silviu Radu

A symbolic method is used to establish some properties of the Bernoulli-Barnes polynomials.

Number Theory · Mathematics 2017-05-11 Lin Jiu , Victor H. Moll , Christophe Vignat

In this paper, we study the existence and nonexistence of positive solutions for a coupled elliptic system with critical exponent and logarithmic terms. The presence of the the logarithmic terms brings major challenges and makes it…

Analysis of PDEs · Mathematics 2023-04-28 Hichem Hajaiej , Tianhao Liu , Linjie Song , Wenming Zou

The ZX-calculus is a powerful framework for reasoning in quantum computing. It provides in particular a compact representation of matrices of interests. A peculiar property of the ZX-calculus is the absence of a formal sum allowing the…

Quantum Physics · Physics 2024-08-07 Emmanuel Jeandel , Simon Perdrix , Margarita Veshchezerova

Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…

Probability · Mathematics 2019-06-18 Adrien Hardy

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2012-04-03 Yuan Li , Haibin Kan

In the work we propose an algorithm for a Wiener -- Hopf factorization of scalar polynomials based on notions of indices and essential polynomials. The algorithm uses computations with finite Toeplitz matrices and permits to obtain…

Numerical Analysis · Mathematics 2018-06-06 Victor Adukov

The multiplier $\lambda_n$ of a periodic orbit of period $n$ can be viewed as a (multiple-valued) algebraic function on the space of all complex quadratic polynomials $p_c(z)=z^2+c$. We provide a numerical algorithm for computing critical…

Dynamical Systems · Mathematics 2019-02-28 Anna Belova , Igors Gorbovickis

We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Such sums appear, for instance, in the expansion of Gauss hypergeometric functions around integer indices that depend on a symbolic parameter.…

High Energy Physics - Theory · Physics 2020-12-30 Andrew J. McLeod , Henrik Munch , Georgios Papathanasiou , Matt von Hippel

Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…

Logic in Computer Science · Computer Science 2020-05-29 Ciarán Dunne , J. B. Wells , Fairouz Kamareddine

We outline a new algorithm to solve coupled systems of differential equations in one continuous variable $x$ (resp. coupled difference equations in one discrete variable $N$) depending on a small parameter $\epsilon$: given such a system…

Symbolic Computation · Computer Science 2014-07-11 Johannes Bluemlein , Abilio De Freitas , Carsten Schneider

Large-scale vision-language models such as CLIP have achieved remarkable success in zero-shot image recognition, yet their predictions remain largely opaque to human understanding. In contrast, Concept Bottleneck Models provide…

Computer Vision and Pattern Recognition · Computer Science 2026-03-31 Onat Ozdemir , Anders Christensen , Stephan Alaniz , Zeynep Akata , Emre Akbas

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

Symbolic Computation · Computer Science 2021-04-05 Jérémy Berthomieu , Andrew Ferguson , Mohab Safey El Din