相关论文: Termination orders for 3-polygraphs
We exhibit three classes of algebraic constraints which are shown compatible with Volterra lattice.
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In…
We classify the orbit closures in the variety Nov_3 of complex, 3-dimensional Novikov algebras and obtain the Hasse diagrams for the closure ordering of the orbits. We provide invariants which are easy to compute and which enable us to…
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…
For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…
In this paper, we define some new notions of triangular Banach algebras and we investigate the derivations on these algebras.
Convex hexagons that can tile the plane have been classified into three types. For the generic cases (not necessarily convex) of the three types and two other special cases, we classify tilings of the plane under the assumption that all…
We show upper and lower bounds for angles in iterations of trisections of certain triangulations.
We describe a method to compute the Brauer-Manin obstruction for smooth cubic surfaces over $\bbQ$ such that $\Br(S)/\Br(\bbQ)$ is a 3-group. Our approach is to associate a Brauer class with every ordered triplet of Galois invariant pairs…
In this paper, we construct infinitely many quadruples of real quadratic fields whose class numbers are all divisible by $3$. To the best of our knowledge, this is the first result towards the divisibility of the class numbers of certain…
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
3-list colouring is an NP-complete decision problem. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving 3-list colouring on permutation graphs.
The problem when the order polytope and the chain polytope of a finite partially ordered set are unimodularly equivalent will be solved.
We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped…
The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…
In this paper we study the operation of cutting off edges of a simple $3$-polytope $P$ along the graph $\Gamma$. We give the criterion when the resulting polytope is simple and when it is flag. As a corollary we prove the analog of…
Characterizations of the star, minus and diamond orders of operators are given in various contexts and the relationship between these orders is made more transparent. Moreover, we introduce a new partial order of operators which provides a…
This is the less official, English version of the proof of the fact that every closed atoroidal 3-manifold carries finitely many isotopy classes of tight contact structures.
In this note, finite type epimorphisms of rings are characterized.