English
Related papers

Related papers: An evaluation algorithm for q-B\'ezier triangular …

200 papers

This study focuses on Concave mappings, a class of univalent functions that exhibit a unique property: they map the unit disk onto a domain whose complement is convex. The main objective of this work is to characterize these mappings in…

Complex Variables · Mathematics 2023-08-17 V. Bravo , R. Hernández , O. Venegas

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Logic in Computer Science · Computer Science 2026-05-21 Arka Ghosh , Sławomir Lasota

We propose an alternative definition of q-supernomial coefficients as characters of coinvariants for one dimensional lattice vertex operator algebras. This gives a new formula for q-supernomial coefficients. Along the way we prove that the…

Quantum Algebra · Mathematics 2009-11-07 B. L. Feigin , S. A. Loktev , I. Yu. Tipunin

This extended abstract is about an effort to build a formal description of a triangulation algorithm starting with a naive description of the algorithm where triangles, edges, and triangulations are simply given as sets and the most complex…

Logic in Computer Science · Computer Science 2018-09-05 Yves Bertot

Complex-valued harmonic functions that are univalent and sense-preserving in the open unit disk are widely studied. A new methodology is employed to construct subclasses of univalent harmonic mappings from a given subfamily of univalent…

Complex Variables · Mathematics 2012-09-04 Sumit Nagpal , V. Ravichandran

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

Computational Complexity · Computer Science 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

We compute an analogue of Pascal's triangle enriched in bilinear forms over a finite field. This gives an arithmetically meaningful count of the ways to choose $j$ ring homomorphisms into an algebraic closure from an \'etale extension of…

Number Theory · Mathematics 2026-01-12 Chongyao Chen , Kirsten Wickelgren

Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…

Combinatorics · Mathematics 2011-06-16 William Y. C. Chen , Daniel K. Du , Charles B. Mei

In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…

Number Theory · Mathematics 2016-06-07 Mohamed El Bachraoui

In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…

Symbolic Computation · Computer Science 2021-01-01 Dingkang Wang , Hesong Wang , Fanghui Xiao

We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…

Classical Analysis and ODEs · Mathematics 2025-08-27 Erik Koelink , Pablo Román , Wadim Zudilin

In this paper we study the images of multilinear graded polynomials on the graded algebra of upper triangular matrices UT_n. For positive integers q \leq n, we classify these images on UT_n endowed with a particular elementary Z_q-grading.…

Rings and Algebras · Mathematics 2022-09-22 Pedro Fagundes , Plamen Koshlukov

One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor…

Quantum Physics · Physics 2016-10-17 Gorjan Alagic , Edgar A. Bering

This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…

Optimization and Control · Mathematics 2022-09-28 Jong-Shi Pang , Shaoning Han

We investigate equivariant birational geometry of rational surfaces and threefolds from the perspective of derived categories.

Algebraic Geometry · Mathematics 2023-11-28 Christian Böhning , Hans-Christian Graf von Bothmer , Yuri Tschinkel

We give a new method to construct linear spaces of matrices of constant rank, based on truncated graded cohomology modules of certain vector bundles as well as on the existence of graded Artinian modules with pure resolutions. Our method…

Algebraic Geometry · Mathematics 2017-02-07 Ada Boralevi , Daniele Faenzi , Paolo Lella

New differential-recurrence properties of dual Bernstein polynomials are given which follow from relations between dual Bernstein and orthogonal Hahn and Jacobi polynomials. Using these results, a fourth-order differential equation…

Numerical Analysis · Mathematics 2018-06-19 Filip Chudy , Paweł Woźny

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

We prove a universal recursive formulas for Branson's $Q$-curvature of order eight in terms of lower-order $Q$-curvatures, lower-order GJMS-operators and holographic coefficients. The results prove a special case of a conjecture in…

Differential Geometry · Mathematics 2009-12-14 Andreas Juhl