相关论文: On polytopes associated to factorisations of prime…
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
In this paper we show how to construct inner and outer convex approximations of a polytope from an approximate cone factorization of its slack matrix. This provides a robust generalization of the famous result of Yannakakis that polyhedral…
Mersenne primes and Fermat primes may be thought of as primes of the form $\Phi_m(2)$, where $\Phi_m(x)$ is the $m$th cyclotomic polynomial. This paper discusses the more general problem of primes and composites of this form.
Let $q = p^s$ be a power of a prime number $p$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi_{2^nr}$ over $\mathbb{F}_q$ where both $r…
In factoring matrices into the product of two matrices operations are typically performed with elements restricted to matrix subspaces. Such modest structural assumptions are realistic, for example, in large scale computations. This paper…
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…
It is known that a lattice path matroid polytope can be associated with two given noncrossing lattice paths on $\mathbb{Z}\times\mathbb{Z}$ with the same end points. In this short note we give explicit formulae for the $f$-vector, toric…
We observe that there is an equivalence between the singularity category of an affine complete intersection and the homotopy category of matrix factorizations over a related scheme. This relies in part on a theorem of Orlov. Using this…
We classify valuations on lattice polygons with values in the ring of formal power series that commute with the action of the affine unimodular group. A typical example of such valuations is induced by the Laplace transform, but as it turns…
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high…
We obtain the double factorization of braided bialgebras or braided Hopf algebras, give relation among integrals and semisimplicity of braided Hopf algebra and its factors.
Factorization into spheres is achieved for skeleta of the simplex, cube, and cross-polytope, both explicitly and using Keevash's proof of existence of designs.
We clarify the notion of effective equivalence and characterize geometrically the effectively equivalent permutation groups. In particular, we present examples showing that the latter do not correspond to affinely equivalent polytopes…
The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…
Cyclic polytopes are generally known for being involved in the Upper Bound Theorem, but they have another extremal property which is less well known. Namely, the special shape of their f-vectors makes them applicable to certain…
In this paper we investigate some interesting formulae of q-Euler numbers and polynomials related to the modified q-Bernstein polynomials.
Subsequently to the author's preceding paper, we give full proofs of some explicit formulas about factorizations of $K$-$k$-Schur functions associated with any multiple $k$-rectangles.
Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…