English
Related papers

Related papers: Explicit Commutative ROABPs from Partial Derivativ…

200 papers

We consider settings in which the distribution of a multivariate random variable is partly ambiguous. We assume the ambiguity lies on the level of the dependence structure, and that the marginal distributions are known. Furthermore, a…

Mathematical Finance · Quantitative Finance 2020-05-27 Stephan Eckstein , Michael Kupper , Mathias Pohl

The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…

Numerical Analysis · Mathematics 2022-12-05 Chao Zeng

We introduce a new structural graph parameter called \emph{partial matching width}. For each (sufficiently large) integer $k \geq 1$, we introduce a class $\mathcal{G}_k$ of graphs of treewidth at most $k$ and max-degree $7$ such that for…

Computational Complexity · Computer Science 2017-09-28 Igor Razgon

The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…

Computational Complexity · Computer Science 2009-08-14 V. Arvind , Pushkar S. Joglekar , Srikanth Srinivasan

For a set of integers $A$, we consider $R(A)=\{a/b: a, b\in A, b\neq 0\}$. It is an open problem to study the denseness of $R(A)$ in the $p$-adic numbers when $A$ is the set of nonzero values attained by an integral form. This problem has…

Number Theory · Mathematics 2022-01-13 Deepa Antony , Rupam Barman , Piotr Miska

For a prime $p$ and a matrix $A \in \mathbb{Z}^{n \times n}$, write $A$ as $A = p (A \,\mathrm{quo}\, p) + (A \,\mathrm{rem}\, p)$ where the remainder and quotient operations are applied element-wise. Write the $p$-adic expansion of $A$ as…

Number Theory · Mathematics 2014-02-03 Mustafa Elsheikh , Andy Novocin , Mark Giesbrecht

We prove that the multiplicity of an arbitrary dominant weight for an integrable highest weight representation of the affine Kac-Moody algebra $A_{r}^{(1)}$ is a polynomial in the rank $r$. In the process we show that the degree of this…

Representation Theory · Mathematics 2007-05-23 Georgia Benkart , Seok-Jin Kang , Hyeonmi Lee , Kailash C. Misra , Dong-Uy Shin

Let $k$ be a perfect field of characteristic $p > 2$, and let $K$ be a finite totally ramified extension over $W(k)[\frac{1}{p}]$. Let $R_0$ be an unramified relative base ring over $W(k)\langle X_1^{\pm 1}, \ldots, X_d^{\pm 1}\rangle$, and…

Number Theory · Mathematics 2018-10-16 Yong Suk Moon

In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…

Statistics Theory · Mathematics 2025-07-11 Bertrand Even , Christophe Giraud , Nicolas Verzelen

In this paper we construct the main algebraic and differential properties and the weight functions of orthogonal polynomial solutions of bivariate second--order linear partial differential equations, which are admissible potentially…

Analysis of PDEs · Mathematics 2011-01-14 I. Area , E. Godoy , A. Ronveaux , A. Zarzo

Suppose a finite dimensional semisimple Lie algebra $\mathfrak g$ acts by derivations on a finite dimensional associative or Lie algebra $A$ over a field of characteristic $0$. We prove the $\mathfrak g$-invariant analogs of Wedderburn -…

Rings and Algebras · Mathematics 2014-09-02 A. S. Gordienko , M. V. Kochetov

An automaton is partially ordered if the only cycles in its transition diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can be characterized by the Straubing-Th\'erien hierarchy. Level 3/2 is recognized by poNFAs,…

Formal Languages and Automata Theory · Computer Science 2017-04-27 Tomáš Masopust , Markus Krötzsch

In this paper we present a weighted $L_p$-theory of second-order parabolic partial differential equations defined on $C^1$ domains. The leading coefficients are assumed to be measurable in time variable and have VMO (vanishing mean…

Analysis of PDEs · Mathematics 2012-08-14 Kyeong-Hun Kim , Kijung Lee

Let $A$ be a finite dimensional associative algebra with derivations over a field of characteristic zero, i.e., an algebra whose structure is enriched by the action of a Lie algebra $L$ by derivations, and let $c_n^L(A),$ $n\geq 1,$ be its…

Rings and Algebras · Mathematics 2023-08-10 Carla Rizzo

This paper presents a new anytime algorithm for the marginal MAP problem in graphical models. The algorithm is described in detail, its complexity and convergence rate are studied, and relations to previous theoretical results for the…

Artificial Intelligence · Computer Science 2012-12-21 Denis Maua , Cassio De Campos

Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…

Artificial Intelligence · Computer Science 2025-05-08 Luise Ge , Brendan Juba , Kris Nilsson

In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.

Information Theory · Computer Science 2025-09-23 J. J. Bernal , J. J. Simón

Classical invariants for representations of one Lie group can often be related to invariants of some other Lie group. Physics suggests that the right objects to consider for these questions are certain refinements of classical invariants…

Representation Theory · Mathematics 2015-12-01 Swarnava Mukhopadhyay

In this paper, we introduce a novel generalization of the classical property of algebras known as "being alternative," which we term "partially alternative." This new concept broadens the scope of alternative algebras, offering a fresh…

Rings and Algebras · Mathematics 2025-05-14 Tianran Hua , Ekaterina Napedenina , Marina Tvalavadze

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

Computational Complexity · Computer Science 2013-02-15 Mrinal Kumar , Gaurav Maheshwari , Jayalal Sarma M. N