English
Related papers

Related papers: Separating ABPs and Some Structured Formulas in th…

200 papers

Chordal and factor-width decomposition methods for semidefinite programming and polynomial optimization have recently enabled the analysis and control of large-scale linear systems and medium-scale nonlinear systems. Chordal decomposition…

Optimization and Control · Mathematics 2021-11-23 Yang Zheng , Giovanni Fantuzzi , Antonis Papachristodoulou

In this paper, we study quantum Ordered Binary Decision Diagrams($OBDD$) model; it is a restricted version of read-once quantum branching programs, with respect to "width" complexity. It is known that the maximal gap between deterministic…

Quantum Physics · Physics 2022-04-25 Kamil Khadiev , Aliya Khadieva , Alexander Knop

Let $A$ be an abelian variety over a finite field $k$ with $|k|=q=p^m$. Let $\pi\in \text{End}_k(A)$ denote the Frobenius and let $v=\frac{q}{\pi}$ denote Verschiebung. Suppose the Weil $q$-polynomial of $A$ is irreducible. When…

Number Theory · Mathematics 2021-09-10 Hanson Smith

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Computational Geometry · Computer Science 2026-03-20 Alexander Munteanu , Simon Omlor , Jeff M. Phillips

Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…

Number Theory · Mathematics 2017-03-29 Jacqueline Anderson

We point out an asymptotic formula for the power moments of the function $a(n)$, representing the number of non-isomorphic Abelian groups of order $n$. For the quadratic moment this improves an earlier result due to L. Zhang, M. L\"u and W.…

Number Theory · Mathematics 2012-11-13 László Tóth

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

Numerical Analysis · Mathematics 2025-10-20 Vladimir P. Gerdt , Soso A. Gogilidze

We consider a space of complex polynomials of degree $n\ge 3$ with $n-1$ distinguished periodic orbits. We prove that the multipliers of these periodic orbits considered as algebraic functions on that space, are algebraically independent…

Dynamical Systems · Mathematics 2019-02-20 Igors Gorbovickis

We define a new family of noncommutative Bell polynomials in the algebra of free quasi-symmetric functions and relate it to the dual immaculate basis of quasi-symmetric functions. We obtain noncommutative versions of Grinberg's results…

Combinatorics · Mathematics 2020-03-23 Jean-Christophe Novelli , Jean-Yves Thibon , Frédéric Toumazet

We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…

Numerical Analysis · Mathematics 2010-04-22 Richard P. Brent

We derive exact formulas for the proportions of derangements and of derangements of $p$-power order in the affine classical groups $AU_m(q)$, $ASp_{2m}(q)$, $AO_{2m+1}(q)$ and $AO^{\pm}_{2m}(q)$, where $p$ denotes the characteristic of the…

Combinatorics · Mathematics 2026-05-06 Jessica Anzanello

(Dieudonn\'e and) Dwork's lemma gives a necessary and sufficient condition for an exponential of a formal power series $S(z)$ with coefficients in $Q_p$ to have coefficients in $Z_p$. We establish theorems on the $p$-adic valuation of the…

Group Theory · Mathematics 2015-08-12 Christian Krattenthaler , Thomas W. Müller

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

Number Theory · Mathematics 2019-02-12 Gareth Boxall , Gareth Jones , Harry Schmidt

Multidimensional population balance models (PBMs) describe chemical and biological processes having a distribution over two or more intrinsic properties (such as size and age, or two independent spatial variables). The incorporation of…

Computational Engineering, Finance, and Science · Computer Science 2025-04-29 Pavan Inguva , Richard D. Braatz

We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…

Logic · Mathematics 2026-03-23 Eugenio Clerico

Let $[X,\lambda]$ be a principally polarized abelian variety over a finite field with commutative endomorphism ring; further suppose that either $X$ is ordinary or the field is prime. Motivated by an equidistribution heuristic, we introduce…

Number Theory · Mathematics 2023-05-31 Jeff Achter , Salim Ali Altug , Luis Garcia , Julia Gordon , Wen-Wei Li , Thomas Rüd

We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…

Mathematical Software · Computer Science 2010-02-18 Fabrizio Caruso

In recent years, progress toward the classification of superintegrable systems with higher order integrals of motion has been made. In particular, a complete classification of all exotic potentials with a third or a fourth order integrals,…

Mathematical Physics · Physics 2020-11-10 Ian Marquette

We construct a set $M_d$ whose points parametrize families of Meixner polynomials in $d$ variables. There is a natural bispectral involution $b$ on $M_d$ which corresponds to a symmetry between the variables and the degree indices of the…

Classical Analysis and ODEs · Mathematics 2012-05-25 Plamen Iliev

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…

Computational Complexity · Computer Science 2022-02-14 Oliver Korten