Related papers: Linear extensions and continued fractions
Achieving the goals in the title (and others) relies on a cardinality-wise scanning of the ideals of the poset. Specifically, the relevant numbers attached to the k+1 element ideals are inferred from the corresponding numbers of the…
We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the arithmetic and geometry of algebraic curves.
In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…
introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…
We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…
In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…
The standard notion of poset probability of a finite poset P involves calculating, for incomparable $\alpha$, $\beta$ in P, the number of linear extensions of P for which $\alpha$ precedes $\beta$. The fraction of those linear extensions…
We introduce the Limiter, a universal extension of the real numbers and of the limit functional that assigns a canonical limit in an enlarged space to every real sequence. Motivated by generalized summation methods such as Borel summation…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…
In this article we study solutions to second order linear difference equations with variable coefficients. Under mild conditions we provide closed form solutions using finite continued fraction representations. The proof of the results are…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
In this paper we consider approximations of Neumann problems for the integral fractional Laplacian by continuous, piecewise linear finite elements. We analyze the weak formulation of such problems, including their well-posedness and…
We construct explicitly in any finite field of the form Fq[x]/(x^m-a) elements with multiplicative order at least 2^{(2m)^(1/2)}
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…
We first formulate an inverse problem for a linear fractional Lam\'e system. We determine the Lam\'e parameters from exterior partial measurements of the Dirichlet-to-Neumann map. We further study an inverse obstacle problem as well as an…
In 1952, Perron showed that quadratic residues in a field of prime order satisfy certain ad- ditive properties. This result has been generalized in different directions, and our contribution is to provide a further generalization concerning…
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.
We study the minimal length elements in some double cosets of Coxeter groups and use them to study Lusztig's $G$-stable pieces and the generalization of $G$-stable pieces introduced by Lu and Yakimov. We also use them to study the minimal…
We develop Grothendieck's theory of dualizing complexes on finite posets, and its subsequent theory of Cohen-Macaulayness.