English
Related papers

Related papers: Uniform, Integral and Feasible Proofs for the Dete…

200 papers

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

Algebraic Geometry · Mathematics 2024-12-24 Kartoue Mady Demdah , Ibrahim Nonkane

Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…

Quantum Physics · Physics 2020-04-08 Matthew Amy , Andrew N. Glaudell , Neil J. Ross

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…

Discrete Mathematics · Computer Science 2019-01-08 Pavel Emelyanov , Denis Ponomaryov

Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…

Combinatorics · Mathematics 2025-09-01 Dandan Chen , Ziyin Zou

We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…

Combinatorics · Mathematics 2015-09-18 D. Betea , M. Wheeler , P. Zinn-Justin

In this note we classify two-dimensional continued fractions for cubic irrationalities constructed by matrices with not large norm ($|*| \le 6$). The classification is based on the following new result: the class of matrices with an…

Number Theory · Mathematics 2009-11-17 Oleg Karpenkov

We find upper and lower bounds of the multiplicities of irreducible admissible representations $\pi$ of a semisimple Lie group $G$ occurring in the induced representations $Ind_H^G\tau$ from irreducible representations $\tau$ of a closed…

Representation Theory · Mathematics 2013-10-09 Toshiyuki Kobayashi , Toshio Oshima

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

Logic in Computer Science · Computer Science 2017-03-14 Robin Adams , Marc Bezem , Thierry Coquand

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

Rings and Algebras · Mathematics 2007-05-23 Constantin M. Petridi , P. B. Krikelis

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

Number Theory · Mathematics 2025-10-20 J. Maurice Rojas

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

Representation Theory · Mathematics 2023-06-05 Lizhong Wang , Jiping Zhang

We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal)…

Logic · Mathematics 2019-05-21 Taus Brock-Nannestad , Danko Ilik

Recently, it is well known that the conjectural integral identity is of crucial importance in the motivic Donaldson-Thomas invariants theory for non-commutative Calabi-Yau threefolds. The purpose of this article is to consider different…

Algebraic Geometry · Mathematics 2015-11-03 Le Quy Thuong

Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…

General Mathematics · Mathematics 2024-08-23 Petar P. Petrov

In this paper, we suggest a construction of determinant lines of finitely generated Hilbertian modules over finite von Neumann algebras. Nonzero elements of the determinant lines can be viewed as volume forms on the Hilbertian modules.…

dg-ga · Mathematics 2013-09-02 A. Carey , M. Farber , V. Mathai

We give simple proofs of the Davenport--Heilbronn theorems, which provide the main terms in the asymptotics for the number of cubic fields having bounded discriminant and for the number of 3-torsion elements in the class groups of quadratic…

Number Theory · Mathematics 2012-06-22 Manjul Bhargava , Arul Shankar , Jacob Tsimerman

Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…

High Energy Physics - Theory · Physics 2009-10-28 Omar Foda , Yas-Hiro Quano

It is studied the Cauchy problem for the equations of Burgers' type but with bounded dissipation flux. Such equations degenerate to hyperbolic ones as the velocity gradient tends to infinity. Thus the discontinuous solutions are permitted.…

Analysis of PDEs · Mathematics 2007-05-23 Yuri G. Rykov

In this article, we study and settle several structural questions concerning the exact solvability of the Olshanetsky-Perelomov quantum Hamiltonians corresponding to an arbitrary root system. We show that these operators can be written as…

solv-int · Physics 2015-06-26 N. Kamran , R. Milson

We display an application of the notions of kernelization and data reduction from parameterized complexity to proof complexity: Specifically, we show that the existence of data reduction rules for a parameterized problem having (a). a…

Computational Complexity · Computer Science 2021-04-29 Gabriel Istrate , Cosmin Bonchis , Adrian Craciun