English
Related papers

Related papers: Congruences of Multinomial Lattices

200 papers

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

Number Theory · Mathematics 2007-07-25 Zhi-Wei Sun , Donald M. Davis

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

We define and study several new interleaving distances for persistent cohomology which take into account the algebraic structures of the cohomology of a space, for instance the cup product or the action of the Steenrod algebra. In…

Algebraic Topology · Mathematics 2021-04-05 Grégory Ginot , Johan Leray

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy conditions (i), (ii) below. (i) There exists a…

Quantum Algebra · Mathematics 2008-07-24 Paul Terwilliger

We review and motivate recently-observed relationships between exactly solvable lattice models and modular representations of Hecke algebras. Firstly, we describe how the set of $n$-regular partitions label both of the following classes of…

q-alg · Mathematics 2008-02-03 Omar Foda , Bernard Leclerc , Masato Okado , Jean-Yves Thibon , Trevor A. Welsh

For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…

Computational Complexity · Computer Science 2012-10-31 Matthias Christandl , Brent Doran , Michael Walter

Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…

Rings and Algebras · Mathematics 2007-05-23 Jeno Szigeti

Although it is important both in theory as well as in applications, a theory of Birkhoff interpolation with main emphasis on the shape of the set of nodes is still missing. Although we will consider various shapes (e.g. we find all the…

Numerical Analysis · Mathematics 2007-05-23 Marius Crainic , Nicolae Crainic

In this paper, we develop some foundations for a theory of algebraic varieties of congruences on commutative semirings. By studying the structure of congruences, firstly, we show that the spectrum $ \text{Spec}^{c}(A) $ consisting of prime…

Rings and Algebras · Mathematics 2024-12-23 Derong Qiu

Complemented lattices and uniquely complemented lattices are very important, not only in mathematics, but also in physics, biology, and even in social sciences. They have been investigated for a long time, especially by Huntington,…

History and Overview · Mathematics 2023-08-10 Daniel Parrochia

In this paper we report on recent results by several authors, on the spectral theory of lens spaces and orbifolds and similar locally symmetric spaces of rank one. Most of these results are related to those obtained by the authors in [IMRN…

Differential Geometry · Mathematics 2021-08-11 Emilio A. Lauret , Roberto J. Miatello , Juan Pablo Rossetti

The bulk-boundary and a new bulk-defect correspondence principles are formulated using groupoid algebras. The new strategy relies on the observation that the groupoids of lattices with boundaries or defects display spaces of units with…

Operator Algebras · Mathematics 2021-09-24 Emil Prodan

We begin with a short exposition of the theory of lattice varieties. This includes a description of their orbit structure and smooth locus. We construct a flat cover of the lattice variety and show that it is a complete intersection. We…

Algebraic Geometry · Mathematics 2014-11-17 William Haboush , Akira Sano

Structures involving a lattice and join-endomorphisms on it are ubiquitous in computer science. We study the cardinality of the set $\mathcal{E}(L)$ of all join-endomorphisms of a given finite lattice $L$. In particular, we show for…

Multiagent Systems · Computer Science 2022-11-03 Carlos Pinzón , Santiago Quintero , Sergio Ramírez , Camilo Rueda , Frank Valencia

We explore a relationship between the classical representation theory of a complex, semisimple Lie algebra \g and the resonance varieties R(V,K)\subset V^* attached to irreducible \g-modules V and submodules K\subset V\wedge V. In the…

Representation Theory · Mathematics 2016-11-17 Stefan Papadima , Alexander I. Suciu

It is well-known that Leonard pairs have a close connection with bispectral orthogonal polynomials of the Askey scheme. In this paper, we introduce the notion of a Leonard trio $(V,\oV,Z)$, an algebraic structure extending Leonard pairs,…

Rings and Algebras · Mathematics 2026-01-22 Nicolas Crampé , Wolter Groenevelt , Quentin Labriet , Lucia Morey , Luc Vinet , Carel Wagenaar

We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show…

Geometric Topology · Mathematics 2013-12-17 Jozef H. Przytycki , Krzysztof K. Putyra

For a certain class of two-dimensional lattices, lattice-dual pairs are shown to have the same bond percolation critical exponents. A computational proof is given for the martini lattice and its dual to illustrate the method. The result is…

Statistical Mechanics · Physics 2015-05-13 Matthew R. A. Sedlock , John C. Wierman

We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…

Optimization and Control · Mathematics 2025-10-07 Milan Hladík

The coordination sequence s(k) of a graph counts the number of its vertices which have distance k from a given vertex, where the distance between two vertices is defined as the minimal number of bonds in any path connecting them. For a…

Statistical Mechanics · Physics 2008-02-03 Michael Baake , Uwe Grimm
‹ Prev 1 8 9 10 Next ›