English
Related papers

Related papers: Semi-invariants of binary forms and symmetrized gr…

200 papers

Following the program of investigation of alternative spinor duals potentially applicable to fermions beyond the standard model, we demonstrate explicitly the existence of several well-defined spinor duals. Going further we define a mapping…

General Physics · Physics 2020-05-20 R. T. Cavalcanti , J. M. Hoff da Silva

In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…

Combinatorics · Mathematics 2020-12-29 Carmelo Cisto , Wanderson Tenório

This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all…

Data Structures and Algorithms · Computer Science 2023-01-24 Alpár Jüttner , Péter Madarasi

Let $(Q,\sigma)$ be a symmetric quiver, where $Q=(Q_0,Q_1)$ is a finite quiver without oriented cycles and $\sigma$ is a contravariant involution on $Q_0\sqcup Q_1$. The involution allows us to define a nondegenerate bilinear form $<,>$ on…

Representation Theory · Mathematics 2016-11-11 Riccardo Aragona

We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…

Dynamical Systems · Mathematics 2020-10-14 Deliang Chen

We show that various actions of topological conformal theories that were suggested recentely are particular cases of a general action. We prove the invariance of these models under transformations generated by nilpotent fermionic generators…

High Energy Physics - Theory · Physics 2007-05-23 J. Sonnenschein , S. Yankielowicz

Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…

Commutative Algebra · Mathematics 2017-10-10 Andries E. Brouwer , Jan Draisma

In this paper we study those submonoids of $\mathbb{N}^d$ which a non-trivial pseudo-Frobenius set. In the affine case, we prove that they are the affine semigroups whose associated algebra over a field has maximal projective dimension…

Commutative Algebra · Mathematics 2019-03-27 J. I. García-García , I. Ojeda , J. C. Rosales , A. Vigneron-Tenorio

Given an action of a monoid $T$ on a ring $A$ by ring endomorphisms, and an Ore subset $S$ of $T$, a general construction of a fractional skew monoid ring $S^{\rm op} * A * T$ is given, extending the usual constructions of skew group rings…

Rings and Algebras · Mathematics 2007-05-23 P. Ara , M. A. Gonzalez-Barroso , K. R. Goodearl , E. Pardo

We find the Holographic Renormalization Group equations for the holographic duals of generic gravity theories coupled to form fields and spin-1/2 fermions. Using Hamilton-Jacobi theory we discuss the structure of Ward identities, anomalies,…

High Energy Physics - Theory · Physics 2009-10-31 Jussi Kalkkinen , Dario Martelli

Graph machine learning architectures are typically tailored to specific tasks on specific datasets, which hinders their broader applicability. This has led to a new quest in graph machine learning: how to build graph foundation models…

Machine Learning · Computer Science 2025-10-29 Ben Finkelshtein , İsmail İlkan Ceylan , Michael Bronstein , Ron Levie

We introduce two families of diagrammatic monoidal supercategories. The first family, depending on an associative superalgebra, generalizes the oriented Brauer category. The second, depending on an involutive superalgebra, generalizes the…

Representation Theory · Mathematics 2025-06-13 Saima Samchuck-Schnarch , Alistair Savage

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

Logic · Mathematics 2015-08-20 M. Malliaris , S. Shelah

We define a family of symmetric and a family of non-symmetric polynomials in terms of vanishing conditions. These families depend on two paramters, q and t. Their main feature is that they consist of non-homogeneous polynomials. The…

q-alg · Mathematics 2008-02-03 Friedrich Knop

The investigation and classification of non-unique factorization phenomena has attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P.A. Garc\'ia-S\'anchez, together with several co-authors, derived…

Number Theory · Mathematics 2011-04-05 Andreas Philipp

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

Combinatorics · Mathematics 2019-08-06 Yu Qing Chen , Teng Fang , Sanming Zhou

A systematic construction for an action describing a class of supersymmetric integrable models as well as for pure fermionic theories is discussed in terms of the gauged WZNW model associated to twisted affine Kac-Moody algebras. Explicit…

High Energy Physics - Theory · Physics 2009-09-28 J. F. Gomes , D. M. Schmidtt , A. H. Zimerman

Let $\sigma$ be a simple involution of an algebraic semisimple group $G$ and let $H$ be the subgroup of $G$ of points fixed by $\sigma$. If the restricted root system is of type $A$, $C$ or $BC$ and $G$ is simply connected or if the…

Representation Theory · Mathematics 2007-05-23 Rocco Chiriví , Peter Littelmann , Andrea Maffei

We define a categorical framework in which we build a systematic construction that provides generic invariants for C*-algebras. The benefit is significant as we show that any invariant arising this way automatically enjoys nice properties…

Operator Algebras · Mathematics 2023-09-06 Laurent Cantier

Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…

Computational Geometry · Computer Science 2026-04-20 Jean Cardinal , Micha Sharir