English
Related papers

Related papers: Binomial posets with non-isomorphic intervals

200 papers

The elements of a finite partial order $P$ can be identified with the maximal indecomposable two-sided ideals of its incidence algebra $\A$, and then for two such ideals, $I\prec J \iff IJ \not=0$. This offers one way to recover a poset…

Combinatorics · Mathematics 2009-11-10 Rafael D. Sorkin

In this paper, we classify all the hyperbolic non-compact Coxeter polytopes of finite volume combinatorial type of which is either a pyramid over a product of two simplices or a product of two simplices of dimension greater than one.…

Metric Geometry · Mathematics 2019-10-25 P. Tumarkin

We derive two formulae for (A + B)^n, where A and B are elements in a non-commutative, associative algebra with identity.

Rings and Algebras · Mathematics 2017-11-28 Walter Wyss

The category of involutive non-commutative sets encodes the structure of an involution compatible with a (co)associative (co)multiplication. We prove that the category of involutive bimonoids in a symmetric monoidal category is equivalent…

Algebraic Topology · Mathematics 2021-02-15 Daniel Graves

We present n-1 different embeddings of string polytopes of type A. We characterize their compatibility with the crystal structure on the string polytopes, and formulate a conjecture describing how to obtain n-1 different atomic…

Representation Theory · Mathematics 2025-05-29 Lara Bossinger , Jacinta Torres

We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.

General Mathematics · Mathematics 2008-03-10 William B. Everett

In general, representations of interval orders may use an arbitrary set of interval lengths. We can define subclasses of interval orders by restricting the allowable lengths of intervals. Motivated by a recent paper of Keller, Trenk, and…

Combinatorics · Mathematics 2024-11-13 Csaba Biro , Sida Wan

Given a bivariate system of polynomial equations with fixed support sets $A, B$ it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity $i$ for all $i$ in the…

Algebraic Geometry · Mathematics 2021-10-26 I. Nikitin

A contractive $n$-tuple $A=(A_1,...,A_n)$ has a minimal joint isometric dilation $S=(S_1,...,S_n)$ where the $S_i$'s are isometries with pairwise orthogonal ranges. This determines a representation of the Cuntz-Toeplitz algebra. When $A$…

Operator Algebras · Mathematics 2007-05-23 Kenneth R. Davidson , David W. Kribs , Miron E. Shpigel

The classification of maximal function fields over a finite field is a difficult open problem, and even determining isomorphism classes among known function fields is challenging in general. We study a particular family of maximal function…

Number Theory · Mathematics 2024-12-09 Jonathan Niemann

We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$. We prove that for any $P$ the maximum number of unrelated copies of $P$ is asymptotic to a constant times the…

Combinatorics · Mathematics 2013-09-27 Andrew P. Dove , Jerrold R. Griggs

We explore the enumeration of some natural classes of graded posets, including all graded posets, (2+2)- and (3+1)-avoiding graded posets, (2+2)-avoiding graded posets, and (3+1)-avoiding graded posets. We obtain enumerative and structural…

Combinatorics · Mathematics 2015-08-05 Yan X. Zhang

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

Probability · Mathematics 2011-10-28 Miguel Abadi , Rodrigo Lambert

We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in…

Logic · Mathematics 2017-09-26 Milos S. Kurilic , Borisa Kuzeljevic

Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…

Functional Analysis · Mathematics 2023-03-01 Sriram Balasubramanian , Neha Hotwani , Scott McCullough

A binary poset code of codimension M (of cardinality 2^{N-M}, where N is the code length) can correct maximum M errors. All possible poset metrics that allow codes of codimension M to be M-, (M-1)- or (M-2)-perfect are described. Some…

Combinatorics · Mathematics 2008-10-26 Hyun Kwang Kim , Denis Krotov

We present two classes of level Eulerian posets. Both classes contain intervals of rank k+1 whose cd-index is the sum over all cd-monomials w of degree k and the coefficient of the monomial w is r to the power of the number of d's in w. We…

Combinatorics · Mathematics 2024-06-17 Richard Ehrenborg

Sequences of orthogonal polynomials that are alternative to the Jacobi polynomials on the interval $[0,1]$ are defined and their properties are established. An $(\alpha,\beta)$-parameterized system of orthogonal polynomials of the…

Classical Analysis and ODEs · Mathematics 2011-05-11 Vladimir S. Chelyshkov

We extend our previous results on the number of integers which are values of some cyclotomic form of degree larger than a given value (see \cite{FW1}), to more general families of binary forms with integer coefficients. Our main ingredient…

Number Theory · Mathematics 2023-06-06 Étienne Fouvry , Michel Waldschmidt

In this paper, we deal with the problem of bisecting binomial coefficients. We find many (previously unknown) infinite classes of integers which admit nontrivial bisections, and a class with only trivial bisections. As a byproduct of this…

Combinatorics · Mathematics 2016-10-10 Eugen J. Ionascu , Thor Martinsen , Pantelimon Stanica