中文
相关论文

相关论文: On ordered face structures and many-to-one computa…

200 篇论文

We show that the category of principal ordered face structures is equivalent to the category of multitopes. We show that the category of principal ordered face structures is equivalent to the category of multitopes. On the way we introduce…

范畴论 · 数学 2008-06-17 Marek Zawadowski

We classify the faces of copositive and completely positive cones over a second-order cone and investigate their dimension and exposedness properties. Then we compute two parameters related to chains of faces of both cones. At the end, we…

最优化与控制 · 数学 2026-04-17 Mitsuhiro Nishijima , Bruno F. Lourenço

We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…

一般拓扑 · 数学 2022-05-09 Pedro J. Chocano , Manuel A. Morón , Francisco R. Ruiz del Portal

We compare computads with multitopic sets. Both these kinds of structures have n-dimensional objects (called n-cells and n-pasting diagrams, respectively). The computads form a subclass of the more familiar class of omega-categories, while…

范畴论 · 数学 2008-11-21 Victor Harnik , Michael Makkai , Marek Zawadowski

We compare various viewpoints on down-sets (simplicial complexes), illustrating how the combinatorial inclusion-exclusion principle may serve as an alternative to more advanced methods of studying their face numbers.

组合数学 · 数学 2015-03-13 Michal Adamaszek

We give an explicit combinatorial description of the two-dimensional faces of both the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a partially ordered set $P$. Using these descriptions, we show that for any…

组合数学 · 数学 2025-09-23 Ragnar Freij-Hollanti , Teemu Lundström , Aki Mori

A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural…

代数几何 · 数学 2024-12-17 Thibault Poiret , Dhruv Ranganathan

We give a general account of family algebras over a finitely presented linear operad, this operad together with its presentation naturally defining an algebraic structure on the set of parameters.

环与代数 · 数学 2020-05-12 Loic Foissy , Dominique Manchon , Yuanyuan Zhang

We introduce the notion of order projections using the order unit property of a positive element in an order unit space and characterize them in terms of (geometric) orthogonality. We describe order projections of the order unit space…

泛函分析 · 数学 2025-06-17 Anil Kumar Karn

We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action of some operads. An operad is an algebraic structure that…

形式语言与自动机理论 · 计算机科学 2016-01-22 Samuele Giraudo , Jean-Gabriel Luque , Ludovic Mignot , Florent Nicart

The structure of topological spaces is analysed here through the lenses of fibrous preorders. Each topological space has an associated fibrous preorder and those fibrous preorders which return a topological space are called spacial. A…

一般拓扑 · 数学 2021-02-22 Nelson Martins-Ferreira

We introduce in this paper a new formalisation of positive opetopes where faces are organised in a poset. Then we show that our definition is equivalent to that of positives opetopes as given by Marek Zawadowski.

组合数学 · 数学 2024-09-05 Louise Leclerc

We study reductions well suited to compare structures and classes of structures with respect to properties based on enumeration reducibility. We introduce the notion of a positive enumerable functor and study the relationship with…

逻辑 · 数学 2021-02-10 Barbara Csima , Dino Rossegger , Zhi Ying "Daniel" Yu

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

度量几何 · 数学 2017-03-23 Vera Roshchina , Tian Sang , David Yost

A description is an entity that can be interpreted as true or false of an object, and using feature structures as descriptions accrues several computational benefits. In this paper, I create an explicit interpretation of a typed feature…

cmp-lg · 计算机科学 2008-02-03 Paul John King

Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…

Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Xavier Allamigeon , Ricardo D. Katz , Pierre-Yves Strub

A correspondence between different $Pin$-type structures on a compact surface and quadratic (linear) forms on its homology is constructed. Addition of structures is defined and expressed in terms of these quadratic forms.

dg-ga · 数学 2008-02-03 A. Degtyarev , S. Finashin

It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…

组合数学 · 数学 2014-10-10 Jürgen Bokowski , Jurij Kovič , Tomaž Pisanski , Arjana Žitnik

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

组合数学 · 数学 2007-05-23 Stefan Felsner , Sarah Kappes
‹ 上一页 1 2 3 10 下一页 ›