English
Related papers

Related papers: NBB bases of some pattern avoiding lattices

200 papers

We establish an arithmeticity vs. non-linearity alternative for irreducible lattices in suitable product groups, such as for instance products of topologically simple groups. This applies notably to a (large class of) Kac-Moody groups. The…

Group Theory · Mathematics 2012-07-10 Nicolas Monod

We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance in permutations on partially ordered sets. The number of permutations on $P$ that avoid the pattern $\pi$ is denoted $Av_P(\pi)$. We…

Combinatorics · Mathematics 2019-12-24 Sam Hopkins , Morgan Weiler

We study $321$-avoiding affine permutations, and prove a formula for their enumeration with respect to the inversion number by using a combinatorial approach. This is done in two different ways, both related to Viennot's theory of heaps.…

Combinatorics · Mathematics 2017-10-11 Riccardo Biagioli , Frédéric Jouhet , Philippe Nadeau

A foundational principle in the study of modules over standard graded polynomial rings is that geometric positivity conditions imply vanishing of Betti numbers. The main goal of this paper is to determine the extent to which this principle…

Commutative Algebra · Mathematics 2024-02-21 Michael K. Brown , Daniel Erman

Bidouble covers $\pi : S \mapsto Q$ of the quadric Q are parametrized by connected families depending on four positive integers a,b,c,d. In the special case where b=d we call them abc-surfaces. Such a Galois covering $\pi$ admits a small…

Algebraic Geometry · Mathematics 2014-11-11 Fabrizio Catanese , Michael Lönne , Bronislaw Wajnryb

We give three applications of a recently-proven "Decomposition Lemma," which allows one to count preimages of certain sets of permutations under West's stack-sorting map $s$. We first enumerate the permutation class…

Combinatorics · Mathematics 2023-06-22 Colin Defant

In order to solve the A-body Schr\"odinger equation both accurately and efficiently for open-shell nuclei, a novel many-body method coined as Bogoliubov many-body perturbation theory (BMBPT) was recently formalized and applied at low…

Nuclear Theory · Physics 2020-12-10 Pepijn Demol , Mikael Frosini , Alexander Tichai , Vittorio Somà , Thomas Duguet

In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare…

Combinatorics · Mathematics 2012-06-21 Michael Dairyko , Lara Pudwell , Samantha Tyner , Casey Wynn

We present a theoretical treatment of the surprisingly large damping observed recently in one-dimensional Bose-Einstein atomic condensates in optical lattices. We show that time-dependent Hartree-Fock-Bogoliubov (HFB) calculations can…

Other Condensed Matter · Physics 2009-11-10 Julio Gea-Banacloche , Ana Maria Rey , Guido Pupillo , Carl J. Williams , Charles W. Clark

Precision measurements of nucleons provide constraints on the Standard Model and can discern the signatures predicted for particles beyond the Standard Model (BSM). Knowing the Standard Model inputs to nucleon matrix elements will be…

High Energy Physics - Lattice · Physics 2015-05-30 Huey-Wen Lin

Natural numbers which are nontrivial multiples of some permutation of their base-$b$ digit representations are called permutiples. Specific cases include numbers which are multiples of cyclic permutations (cyclic numbers) and reversals of…

Combinatorics · Mathematics 2025-02-10 Benjamin V. Holt

A simulated annealing (SA) approach is employed in the determination of different tight binding (TB) sets of parameters for the nitride semiconductors AlN, GaN and InN, as well their limitations and potentialities are also discussed. Two…

Materials Science · Physics 2016-09-21 A. S. Martins , C. E. Fellows

Using bijections between pattern-avoiding permutations and certain full rook placements on Ferrers boards, we give short proofs of two enumerative results. The first is a simplified enumeration of the 3124, 1234-avoiding permutations,…

Combinatorics · Mathematics 2013-10-24 Jonathan Bloom , Vince Vatter

Bogoliubov many-body perturbation theory (BMBPT) relying on the breaking of U(1) global gauge symmetry has been recently formulated and applied to extend the applicability of standard perturbation theory to ab initio calculations of atomic…

Nuclear Theory · Physics 2025-02-27 Pepijn Demol , Thomas Duguet , Alexander Tichai

In 2012 B\'ona showed the rather surprising fact that the cumulative number of occurrences of the classical patterns $231$ and $213$ are the same on the set of permutations avoiding $132$, beside the pattern based statistics $231$ and $213$…

Combinatorics · Mathematics 2014-12-12 Vincent Vajnovszki

The structure of three pattern classes Av(2143, 4321), Av(2143, 4312) and Av(1324, 4312) is determined using the machinery of monotone grid classes. This allows the permutations in these classes to be described in terms of simple diagrams…

Combinatorics · Mathematics 2012-06-15 M. H. Albert , M. D. Atkinson , Robert Brignall

We present the version 2 of AlterBBN, an open public code for the calculation of the abundance of the elements from Big-Bang nucleosynthesis. It does not rely on any closed external library or program, aims at being user-friendly and…

Cosmology and Nongalactic Astrophysics · Physics 2019-04-18 A. Arbey , J. Auffinger , K. P. Hickerson , E. S. Jenssen

We investigate coordination numbers of the cubic lattices with emphases on their analytic behaviors, including the total positivity of the coordination matrices, the distribution of zeros of the coordination polynomials, the asymptotic…

Combinatorics · Mathematics 2023-03-17 Huyile Liang , Yanni Pei , Yi Wang

A $1$-avoiding set is a subset of $\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\mathbb{R}^n)$ denote the maximum fraction of $\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two…

Metric Geometry · Mathematics 2018-03-12 Tamás Keleti , Máté Matolcsi , Fernando Mário de Oliveira Filho , Imre Z. Ruzsa

A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…

Combinatorics · Mathematics 2020-07-08 Jukka Kohonen