English
Related papers

Related papers: Orbits of antichains in certain root posets

200 papers

We give two different, statistically consistent definitions of the length l of a prime knot tied into a polymer ring. In the good solvent regime the polymer is modelled by a self avoiding polygon of N steps on cubic lattice and l is the…

Statistical Mechanics · Physics 2015-06-25 B. Marcone , E. Orlandini , A. L. Stella , F. Zonta

In this paper, using an algebraic approach, it is intended to show that the Goldbach's and Twin primes conjectures are true, building, for each $m>2$, an isomorphism between posets. One of the posets is the set of coprimes less than $m$,…

General Mathematics · Mathematics 2023-09-26 Juan Carlos Riano-Rojas

In this paper we answer a question of Gabriel Navarro about orbit sizes of a finite linear group H acting completely reducibly on a vector space V: if the orbits containing the vectors a and b have coprime lengths m and n, we prove that the…

Group Theory · Mathematics 2011-12-22 Silvio Dolfi , Robert Guralnick , Cheryl Praeger , Pablo Spiga

The rotor-router model, also called the Propp machine, was introduced as a deterministic alternative to the random walk. In this model, a group of identical tokens are initially placed at nodes of the graph. Each node maintains a cyclic…

Discrete Mathematics · Computer Science 2015-05-29 Jérémie Chalopin , Shantanu Das , Pawel Gawrychowski , Adrian Kosowski , Arnaud Labourel , Przemyslaw Uznański

We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…

Combinatorics · Mathematics 2018-02-06 Frank A Campo , Marcel Erné

Extending a classical theorem of Sperner, we characterize the integers $m$ such that there exists a maximal antichain of size $m$ in the Boolean lattice $B_n$, that is, the power set of $[n]:=\{1,2,\dots,n\}$, ordered by inclusion. As an…

Combinatorics · Mathematics 2024-01-30 Jerrold R. Griggs , Thomas Kalinowski , Uwe Leck , Ian T. Roberts , Michael Schmitz

The problem of counting monomer-dimer coverings of a lattice is a longstanding problem in statistical mechanics. It has only been exactly solved for the special case of dimer coverings in two dimensions. In earlier work, Stanley proved a…

Combinatorics · Mathematics 2007-05-23 N. Anzalone , J. Baldwin , I. Bronshtein , T. K. Petersen

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik

Building on classical theorems of Sperner and Kruskal-Katona, we investigate antichains $\mathcal F$ in the Boolean lattice $B_n$ of all subsets of $[n]:=\{1,2,\dots,n\}$, where $\mathcal F$ is flat, meaning that it contains sets of at most…

Combinatorics · Mathematics 2021-12-07 Jerrold R. Griggs , Sven Hartmann , Thomas Kalinowski , Uwe Leck , Ian T. Roberts

Brightwell, van den Heuvel and Stougie proved that the diameter of an $m \times n$ transportation polytope is at most $8(m+n-2)$, a factor of eight away from the Hirsch Conjecture. This bound was improved to $3(m+n-1)$ by Hurkens. We…

Combinatorics · Mathematics 2012-05-15 Henning Bruhn-Fujimoto , Guillaume Chapuy , Edward D. Kim , Vincent Pilaud

We explore semi-dilute and concentrated oligomers and polymers in a broad range of polymerization indices N ranging from 1 to a 100 and in a range of monomer number densities $\phi$ from 0.1 to 0.8 via molecular dynamics simulations and…

Soft Condensed Matter · Physics 2020-12-01 Ashod Khederlarian , Carmen Almasri , Leonid Klushin

Let $\mathfrak{S}_n$ and $\mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(\mathfrak{S}_n,\leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset…

Combinatorics · Mathematics 2018-03-02 John Engbers , Adam Hammett

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

Combinatorics · Mathematics 2024-06-11 Mathilde Bouvel , Lapo Cioni , Benjamin Izart

Given $N\ge2$ closed subspaces $M_1,\dotsc, M_N$ of a Hilbert space $X$, let $P_k$ denote the orthogonal projection onto $M_k$, $1\le k\le N$. It is known that the sequence $(x_n)$, defined recursively by $x_0=x$ and $x_{n+1}=P_N\cdots…

Functional Analysis · Mathematics 2019-02-14 Catalin Badea , David Seifert

Meshalkin's theorem states that a class of ordered p-partitions of an n-set has at most $\max \binom{n}{a_1,...,a_p}$ members if for each k the k'th parts form an antichain. We give a new proof of this and the corresponding LYM inequality…

Combinatorics · Mathematics 2016-10-25 Matthias Beck , Thomas Zaslavsky

Because of the importance of unitarity in quantum physics, work on the representations of the de Sitter group has focussed on the unitary case, which necessarily means infinite dimensional matrices for this non-compact group. Here we…

Group Theory · Mathematics 2025-06-23 Richard A. W. Bradford

Let $P$ be a finite poset of width two, i.e., with no three-element antichain. We associate with $P$ a skew Young diagram $\Upsilon(P)$ and discuss some of the properties of the map $\Upsilon$. In particular, if we regard $\Upsilon(P)$ as a…

Combinatorics · Mathematics 2023-05-05 Richard P. Stanley

Generalizing a result of Miyakawa, Nozaki, Pogosyan and Rosenberg, we prove that there is a one-to-one correspondence between the set of intersecting antichains in a subset of the lower half of the k-valued n-cube and the set of…

Combinatorics · Mathematics 2011-12-01 Roman Glebov

Given a finite poset $\mathcal{P}$, a family $\mathcal{F}$ of elements in the Boolean lattice is induced-$\mathcal{P}$-saturated if $\mathcal{F}$ contains no copy of $\mathcal{P}$ as an induced subposet but every proper superset of…

Combinatorics · Mathematics 2019-08-06 Ryan R. Martin , Heather C. Smith , Shanise Walker

The electron Hamiltonian of narrow semiconductor rings with the Rashba and Dresselhaus spin orbit terms is invariant under time-reversal operation followed by a large gauge transformation. We find that all the eigenstates are doubly…

Mesoscale and Nanoscale Physics · Physics 2009-11-11 S. -R. Eric Yang
‹ Prev 1 4 5 6 7 8 10 Next ›