English
Related papers

Related papers: Polynomial-time Tests for Difference Terms in Idem…

200 papers

This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…

Optimization and Control · Mathematics 2026-01-13 Lei Huang , Lingling Xie

A novel combinatorial formula is developed for for tensor product multiplicities in representation theory. We introduce a difference formula linking these multiplicities to restricted occupancy coefficients via a shifted operator. This…

Representation Theory · Mathematics 2025-12-09 Hongfei Shu , Peng Zhao , Rui-Dong Zhu , Hao Zou

Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…

Formal Languages and Automata Theory · Computer Science 2017-01-11 Thomas Place , Marc Zeitoun

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Group Theory · Mathematics 2007-05-23 J. -C. Birget , A. Yu. Olshanskii , E. Rips , M. Sapir

We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a…

Logic in Computer Science · Computer Science 2016-11-24 Steven de Oliveira , Saddek Bensalem , Virgile Prevosto

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Number Theory · Mathematics 2014-07-02 Ryul Kim , Ok-Hyon Song , Hyon-Chol Ri

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

Group Theory · Mathematics 2026-03-10 Saveliy V. Skresanov

We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…

Formal Languages and Automata Theory · Computer Science 2017-01-30 Helmut Seidl , Sebastian Maneth , Gregor Kemper

A new differential test for series of positive terms is proved. Let f(x) be a positive continuous function corresponded to a series of positive terms f(k), and g(x) is a derivative of reciprocal of f(x). Then, the convergence and divergence…

General Mathematics · Mathematics 2008-05-16 Yi-Fang Chang

Let X be an affine variety and L be a solvable Lie subalgebra of Lie(Aut(X)) generated by a finite collection of locally finite Lie subalgebras. The authors of [arXiv:2507.09679] wondered whether L is itself locally finite. Here we present…

Algebraic Geometry · Mathematics 2026-05-26 Mikhail Zaidenberg

Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for…

Logic in Computer Science · Computer Science 2025-09-03 Jakub Rydval

Several results on presenting an affine algebraic group variety as a product of algebraic varieties are obtained.

Algebraic Geometry · Mathematics 2021-02-17 Vladimir L. Popov

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

Group Theory · Mathematics 2022-02-01 Jonas Deré , Michal Ferov , Mark Pengitore

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

Group Theory · Mathematics 2015-07-07 Emmanuel Jeandel

We present an approach for construction of functional bases of differential invariants for some infinite-dimensional algebras with coefficients of generating operators depending on arbitrary functions. An example for the…

Mathematical Physics · Physics 2007-05-23 Irina Yehorchenko

The behavior of a quantum system depends on how it is measured. How much of what is observed comes from the structure of the quantum system itself and how much from the observer's choice of measurement? We explore these questions by…

Quantum Physics · Physics 2007-05-23 Karoline Wiesner , James P. Crutchfield

The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by $A \in\mathbb{Z}^{m\times{}n}$ and present an algorithm to solve such problems in polynomial-time provided that both the…

Optimization and Control · Mathematics 2016-04-01 Stephan Artmann , Friedrich Eisenbrand , Christoph Glanzer , Timm Oertel , Santosh Vempala , Robert Weismantel

Consider two non-degenerate algebras B and C over the complex numbers. We study a certain class of idempotent elements E in the multiplier algebra of the tensor product of B with C, called separability idempotents. The conditions include…

Rings and Algebras · Mathematics 2015-09-29 Alfons Van Daele

In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…

alg-geom · Mathematics 2008-02-03 R. Garcia , A. Nemethi

In this short note, we describe the so-called homogeneous involution on finite-dimensional graded-division algebra over an algebraically closed field. We also compute their graded polynomial identities with involution. As pointed out by L.…

Rings and Algebras · Mathematics 2024-02-06 Felipe Yukihide Yasumura