English
Related papers

Related papers: On ordered face structures and many-to-one computa…

200 papers

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

Combinatorics · Mathematics 2025-06-30 Sean Mandrick

Multisorted modules, equivalently representations of quivers, equivalently additive functors on preadditive categories, encompass a wide variety of additive structures. In addition, every module has a natural and useful multisorted…

Representation Theory · Mathematics 2018-08-01 Mike Prest

The uniform structure on a differential space defined by a family of generators is considered.

Differential Geometry · Mathematics 2011-03-16 Diana Dziewa-Dawidczyk , Zbigniew Pasternak-Winiarski

There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…

Logic · Mathematics 2008-03-25 Wesley Calvert , Sergey S. Goncharov , Julia F. Knight

We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…

Representation Theory · Mathematics 2012-01-24 Yuriy A. Drozd , Eugene A. Kubichka

We study the notion of geometric structures for toposes: This generalizes the notion of (X,G) manifolds. We give some applications to algebraic geometry

Differential Geometry · Mathematics 2007-05-23 A Tsemo

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

Number Theory · Mathematics 2021-05-04 Antonia W. Bluher

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.

Group Theory · Mathematics 2014-05-07 M. Shahryari

Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.

Discrete Mathematics · Computer Science 2016-08-14 Jin-ichi Itoh , Costin Vîlcu

We provide combinatorial/topological formula for the multiplicity of a complex analytic normal surface singularity whenever the analytic structure on the fixed topological type is generic.

Algebraic Geometry · Mathematics 2020-11-05 János Nagy , András Némethi

We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…

Combinatorics · Mathematics 2010-08-30 P. Blasiak

We classify here combinatorially rigid simple polytopes with three facets more than their dimension.

Combinatorics · Mathematics 2015-12-01 Frédéric Bosio

We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and…

Logic · Mathematics 2021-09-17 Wesley Calvert , Johanna N. Y. Franklin , Dan Turetsky

We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…

Geometric Topology · Mathematics 2007-05-23 Vladimir Turaev

A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…

Data Structures and Algorithms · Computer Science 2023-07-04 Yu-Wei Huang

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…

Combinatorics · Mathematics 2011-11-10 Terence Tao

Many different and complementary strategies for translating the basic principle of multiple topological imaging into observational analysis are now available, both for three-dimensional and two-dimensional catalogues.

Astrophysics · Physics 2017-08-23 Boudewijn F. Roukema

We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.

Combinatorics · Mathematics 2019-01-08 Xuexing Lu , Yu Ye

Let $\Gamma_g$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We introduce a combinatorial structure of "core surfaces", that represent subgroups of $\Gamma_g$. These structures are (usually)…

Group Theory · Mathematics 2022-06-22 Michael Magee , Doron Puder