English
Related papers

Related papers: Lattice Diagram polynomials in one set of variable…

200 papers

For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

Similar to how standard Young tableaux represent paths in the Young lattice, Latin rectangles may be use to enumerate paths in the poset of semi-magic squares with entries zero or one. The symmetries associated to determinant preserve this…

Combinatorics · Mathematics 2022-02-15 Robert W. Donley, , Won Geun Kim

We give a simple and complete description of those convex lattice polygons in the plane that can be dissected into lattice triangles of integer area. A new version of Sperner's Lemma plays a central role.

Combinatorics · Mathematics 2024-09-24 Aaron Abrams , Jamie Pommersheim

We study the multivariate independence polynomials of graphs and the log-concavity of the coefficients of their univariate restrictions. Let $R_{W_4}$ be the operator defined on simple and undirected graphs which replaces each edge with a…

Combinatorics · Mathematics 2025-04-17 Amire Bendjeddou , Leonard Hardiman

We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…

Rings and Algebras · Mathematics 2010-06-24 Stijn Vermeeren

A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…

Combinatorics · Mathematics 2021-01-19 Hery Randriamaro

This article gives an explicit formula for the leading term of the free energy of three-dimensional $U(N)$ lattice gauge theory for any $N$, as the lattice spacing tends to zero. The proof is based on a novel technique that avoids phase…

Mathematical Physics · Physics 2016-05-02 Sourav Chatterjee

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

Commutative Algebra · Mathematics 2012-10-25 William Messing , Victor Reiner

We discuss as a fundamental characteristic of orthogonal polynomials like the existence of a Lie algebra behind them, can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we put…

Mathematical Physics · Physics 2015-06-05 E Celeghini , Mariano A del Olmo

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…

Combinatorics · Mathematics 2012-03-02 Martin Trinks

Section I contains introductory remarks about surface motions. Section II gives a detailed derivation of $H=-\Delta-Tr\sum_{i<j}[X_i,X_j]^2$ as describing a quantized discrete analogue of relativistically invariant membrane dynamics.…

High Energy Physics - Theory · Physics 2007-05-23 Jens Hoppe

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

Combinatorics · Mathematics 2007-05-23 Victor Batyrev

The well-known Lvov-Kaplansky conjecture states that the image of a multilinear polynomial $f$ evaluated on $n\times n$ matrices is a vector space. A weaker version of this conjecture, known as the Mesyan conjecture, states that if $m=deg(…

Rings and Algebras · Mathematics 2022-08-09 Pedro Souza Fagundes , Thiago Castilho de Mello , Pedro Henrique da Silva dos Santos

This paper investigates the zero distribution of a sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $1+ct+B(z)t^{2}+A(z)t^{3}$ where $c\in\mathbb{R}$ and $A(z)$, $B(z)$ are real linear…

Complex Variables · Mathematics 2018-08-23 Khang Tran , Andres Zumba

Recently, new theoretical ideas have allowed the construction of lattice actions which are explicitly invariant under one or more supersymmetries. These theories are local and free of doublers and in the case of Yang-Mills theories also…

High Energy Physics - Lattice · Physics 2010-11-05 Simon Catterall

The Lagrange reconstructing polynomial [Shu C.W.: {\em SIAM Rev.} {\bf 51} (2009) 82--126] of a function $f(x)$ on a given set of equidistant ($\Delta x=\const$) points $\bigl\{x_i+\ell\Delta x;\;\ell\in\{-M_-,...,+M_+\}\bigr\}$ is defined…

Numerical Analysis · Mathematics 2012-04-18 G. A. Gerolymos

In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…

Combinatorics · Mathematics 2026-04-07 Xiangshuai Dong , Tingzeng Wu

We extract an exact formula relating the number of lattice points in an expanding region of a complex semi-simple symmetric space and the automorphic spectrum from a spectral identity, which is obtained by producing two expressions for the…

Number Theory · Mathematics 2011-05-24 Amy DeCelles

Let $K$ be an algebraically closed field of characteristic zero, $\delta$ a nonzero $\mathcal{E}$-derivation of $K[x]$. We first prove that $\operatorname{Im}\delta$ is a Mathieu-Zhao space of $K[x]$ in some cases. Then we prove that LFED…

Algebraic Geometry · Mathematics 2023-11-27 Lintong Lv , Dan Yan

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

Discrete Mathematics · Computer Science 2018-01-08 Ranveer Singh , R. B. Bapat