English
Related papers

Related papers: Identities of the Kauffman Monoid $\mathcal{K}_3$

200 papers

Automated program verification is a difficult problem. It is undecidable even for transition systems over Linear Integer Arithmetic (LIA). Extending the transition system with theory of Arrays, further complicates the problem by requiring…

Logic in Computer Science · Computer Science 2021-06-02 Arie Gurfinkel , Sharon Shoham , Yakir Vizel

In this work we characterize the combinatorial metrics admitting a MacWilliams-type identity and describe the group of linear isometries of such metrics. Considering coverings that are not connected, we classify the metrics satisfying the…

Information Theory · Computer Science 2017-03-27 Jerry Anderson Pinheiro , Roberto Assis Machado , Marcelo Firer

The eigenvector-eigenvalue identities are expanded to include general mixing parameters. Some simple relations are obtained and they reveal an intricate texture of connections between the eigenvalues and the mixing parameters. Permutation…

High Energy Physics - Phenomenology · Physics 2022-08-22 S. H. Chiu , T. K. Kuo

The purpose of this note is twofold. We first review the theory of Fourier-Mukai partners together with the relevant part of Nikulin's theory of lattice embeddings via discriminants. Then we consider Fourier-Mukai partners of K3 surfaces in…

Algebraic Geometry · Mathematics 2012-06-21 Klaus Hulek , David Ploog

Whether the satisfiability of any formula F of propositional calculus can be determined in polynomial time is an open question. I propose a simple procedure based on some real world mechanisms to tackle this problem. The main result is the…

Logic in Computer Science · Computer Science 2010-01-20 Bernd R. Schuh

A generalization of Newton's identity on symmetric functions is given. Using the generalized Newton identity we give a unified method to show the existence of Hall-Littlewood, Jack and Macdonald polynomials. We also give a simple proof of…

Combinatorics · Mathematics 2014-04-22 Wuxing Cai , Naihuan Jing

Identifiability, and the closely related idea of partial smoothness, unify classical active set methods and more general notions of solution structure. Diverse optimization algorithms generate iterates in discrete time that are eventually…

Optimization and Control · Mathematics 2024-06-24 Adrian Lewis , Tonghua Tian

Over an arbitrary field, we conduct a comprehensive study of the polynomial identities and codimensions of two- and three-dimensional metabelian non-Lie Leibniz algebras. In addition, we compute the images of multihomogeneous polynomials on…

Rings and Algebras · Mathematics 2025-12-16 Luis Fertunani , Claudemir Fideles , Airton Muniz

This paper uses the combinatorics of Young tableaux to prove the plactic monoid of infinite rank does not satisfy a non-trivial identity, by showing that the plactic monoid of rank $n$ cannot satisfy a non-trivial identity of length less…

Combinatorics · Mathematics 2017-05-15 Alan J. Cain , Georg Klein , Łukasz Kubat , António Malheiro , Jan Okniński

Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…

Data Structures and Algorithms · Computer Science 2017-05-16 Aubrey Alston

Precise identification of parameters governing quantum processes is a critical task for quantum information and communication technologies. In this work we consider a setting where system evolution is determined by a parameterized…

Quantum Physics · Physics 2014-08-27 Jun Zhang , Mohan Sarovar

We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the…

Combinatorics · Mathematics 2022-10-11 Jacob White

Several natural complex configuration spaces admit surprising uniformizations as arithmetic ball quotients, by identifying each parametrized object with the periods of some auxiliary object. In each case, the theory of canonical models of…

Algebraic Geometry · Mathematics 2020-07-15 Jeff Achter

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

Computational Complexity · Computer Science 2021-07-15 Pascal Koiran , Mateusz Skomra

A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…

Group Theory · Mathematics 2007-05-23 Patrick Dehornoy

In this paper we prove that over algebraically closed field $K$ of positive characteristic $\neq 2$ every automorphism of the group of origin-preserving automorphisms of the polynomial algebra $K[x_1,\ldots, x_n]$ ($n>3$) which fixes every…

Algebraic Geometry · Mathematics 2021-03-25 Alexei Belov-Kanel , Andrey Elishev , Jie-Tai Yu

Let $\mathcal{G}$ denote the variety generated by infinite dimensional Grassmann algebras; i.e., the collection of all unitary associative algebras satisfying the identity $[[z_1,z_2],z_3]=0$, where $[z_i,z_j]=z_iz_j-z_jz_i$. Consider the…

Rings and Algebras · Mathematics 2021-08-13 Nazan Akdogan , Sehmus Findik

Let $A \in \mathbb{Z}^{m \times n}$ be an integral matrix and $a$, $b$, $c \in \mathbb{Z}$ satisfy $a \geq b \geq c \geq 0$. The question is to recognize whether $A$ is $\{a,b,c\}$-modular, i.e., whether the set of $n \times n$…

Optimization and Control · Mathematics 2022-06-15 Christoph Glanzer , Ingo Stallknecht , Robert Weismantel

The energy spectrum of the three-particle Hamiltonian obtained by replacing the two-body trigonometric potential of the Sutherland problem by a three-body one of a similar form is derived. When expressed in appropriate variables, the…

High Energy Physics - Theory · Physics 2009-10-30 C. Quesne

Classical binomial identities are established by giving probabilistic interpretations to the summands. The examples include Vandermonde identity and some generalizations.

Combinatorics · Mathematics 2011-11-17 Christophe Vignat , Victor H. Moll