English
Related papers

Related papers: A Gr\"obner basis for the graph of the reciprocal …

200 papers

In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…

Rings and Algebras · Mathematics 2013-12-17 Susan Durst

We compute the divisor of the modular equation on the modular curve $\Gamma_0(N) \backslash \mathbb H^*$ and then find recurrence relations satisfied by the modular traces of the Hauptmodul for any congruence subgroup $\Gamma_0(N)$ of genus…

Number Theory · Mathematics 2020-02-07 Bumkyu Cho

Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an…

Combinatorics · Mathematics 2021-08-04 Qi Yan , Xian'an Jin

The present paper shall provide a framework for working with Gr\"obner bases over arbitrary rings $k$ with a prescribed finite standard set $\Delta$. We show that the functor associating to a $k$-algebra $B$ the set of all reduced Gr\"obner…

Algebraic Geometry · Mathematics 2011-01-25 Mathias Lederer

In this article, we study properties of the exponential Hilbert series of a $G$-equivariant projective variety, where $G$ is a semisimple, simply-connected complex linear algebraic group. We prove a relationship between the exponential…

Representation Theory · Mathematics 2018-04-16 Wayne A. Johnson

Computation of parallel lines (envelopes) to parabolas, ellipses, and hyperbolas is of importance in structure engineering and theory of mechanisms. Homogeneous polynomials that implicitly define parallel lines for the given offset to a…

Algebraic Geometry · Mathematics 2007-05-23 RafałAbłamowicz , Jane Liu

Given a simple vertex algebra A and a reductive group G of automorphisms of A, the invariant subalgebra A^G is strongly finitely generated in most examples where its structure is known. This phenomenon is subtle, and is generally not true…

Representation Theory · Mathematics 2020-08-10 Andrew R. Linshaw

Given a bounded linear operator $T$ on separable Hilbert space, we develop an approach allowing one to construct a matrix representation for $T$ having certain specified algebraic or asymptotic structure. We obtain matrix representations…

Functional Analysis · Mathematics 2020-10-20 Vladimir Müller , Yuri Tomilov

Given a subspace $U\subset\mathbb{C}[x_1,\dots,x_n]_d$ we consider the closure of the image of the rational map $\mathbb{P}^{n-1}\dashrightarrow\mathbb{P}^{\dim U-1}$ given by $U$. Its coordinate ring is isomorphic to $\bigoplus_{i\ge 0}…

Commutative Algebra · Mathematics 2023-04-06 Julian Vill

We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…

Combinatorics · Mathematics 2019-02-20 Jonathan Leake , Nick Ryder

Let M be a matroid on E, representable over a field of characteristic zero. We show that h-vectors of the following simplicial complexes are log-concave: 1. The matroid complex of independent subsets of E. 2. The broken circuit complex of…

Combinatorics · Mathematics 2012-07-25 June Huh

Let $\Gamma$ denote an undirected, connected, regular graph with vertex set $X$, adjacency matrix $A$, and ${d+1}$ distinct eigenvalues. Let ${\mathcal A}={\mathcal A}(\Gamma)$ denote the subalgebra of Mat$_X({\mathbb C})$ generated by $A$.…

Combinatorics · Mathematics 2020-09-14 M. A. Fiol , Safet Penjić

The intersection of a complex plane curve with a small three-sphere surrounding one of its singularities is a non-trivial link. The refined punctual Hilbert schemes of the singularity parameterize subschemes supported at the singular point…

Algebraic Geometry · Mathematics 2019-12-19 Alexei Oblomkov , Vivek Shende

We study the inverse conductivity problem of how to reconstruct an isotropic electrical conductivity distribution $\gamma$ in an object from static electrical measurements on the boundary of the object. We give an exact reconstruction…

Functional Analysis · Mathematics 2007-05-23 Kim Knudsen , Alexandru Tamasan

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

Classical Analysis and ODEs · Mathematics 2019-12-17 Yuan Xu

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

Combinatorics · Mathematics 2025-12-04 Lazar Guterman , Eran Nevo

Let $\Gamma$ be a finite subgroup of $\SL_2(\C)$. We consider $\Gamma$-fixed point sets in Hilbert schemes of points on the affine plane $\C^2$. The direct sum of homology groups of components has a structure of a representation of the…

Quantum Algebra · Mathematics 2007-05-23 Hiraku Nakajima

A graphical expansion formula for non-commutative matrix integrals with values in a finite-dimensional real or complex von Neumann algebra is obtained in terms of ribbon graphs and their non-orientable counterpart called Moebius graphs. The…

Quantum Algebra · Mathematics 2010-10-05 Motohico Mulase , Josephine T. Yu

This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…

Rings and Algebras · Mathematics 2020-04-14 Vesselin Drensky

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…

Computational Complexity · Computer Science 2015-02-23 Christoph Berkholz , Martin Grohe