Related papers: On Symmetric Polynomials
We investigate the rings of semi-invariants for tame string algebras A(n) of non-polynomial growth. We are interested in dimension vectors of band modules. We use geometric technique related to the description of coordinate rings on…
We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…
Our motivation is to build a systematic method in order to investigate the structure of cluster algebras of geometric type. The method is given through the notion of mixing-type sub-seeds, the theory of seed homomorphisms and the view-point…
Single-scale Feynman diagrams yield integrals that are periods, namely projective integrals of rational functions of Schwinger parameters. Algebraic geometry may therefore inform us of the types of number to which these integrals evaluate.…
Ideas from deformation quantization applied to algebras with one generator lead to methods to treat a nonlinear flat connection. It provides us elements of algebras to be parallel sections. The moduli space of the parallel sections is…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
We explain how deformation theories of geometric objects such as complex structures, Poisson structures and holomorphic bundle structures lead to differential Gerstenhaber or Poisson algebras. We use homological perturbation theory to…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
We explain how to perform topological twisting of supersymmetric field theories in the language of factorization algebras. Namely, given a supersymmetric factorization algebra with a choice of a topological supercharge we construct an…
We characterize locally injective semialgebraic maps between two semialgebraic sets in terms of the induced homomorphism between their rings of (continuous) semialgebraic functions.
In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
The main goal of this paper is to present the application of structural sums, mathematical objects originating from the computational materials science, in construction of a feature space vector of 2D random composites simulated by…
In this paper, we introduce an algebra structure denoted by InvDer algebra whose which we twist an algebra thanks to an invertible derivation, where its inverse is also a derivation. We define InvDer Lie algebras, InvDer associated…
The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…
We investigate a special kind of contraction of symmetric spaces (respectively, of Lie triple systems), called homotopy. In this first part of a series of two papers we construct such contractions for classical symmetric spaces in an…
We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…
We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…
Let $A$ be a $K$-subalgebra of the polynomial ring $S=K[x_1,\ldots,x_d]$ of dimension $d$, generated by finitely many monomials of degree $r$. Then the Gauss algebra $\GG(A)$ of $A$ is generated by monomials of degree $(r-1)d$ in $S$. We…