Related papers: Lexicographic Configurations
We produce many new complete, constant Q-curvature metrics on finitely punctured spheres by gluing together known examples. In our construction we truncate one end of each summand and glue the two summands together "end-to-end," where we've…
A well-known conjecture states that the Whitney numbers of the second kind of a geometric lattice (simple matroid) are logarithmically concave. We show this conjecture to be equivalent to proving an upper bound on the number of new copoints…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…
We define and study complex structures and generalizations on spaces consisting of geodesics or harmonic maps that are compatible with the symmetries of these spaces. The main results are about existence and uniqueness of such structures.
We propose a procedure which allows one to construct local symmetry generators of general quadratic Lagrangian theory. Manifest recurrence relations for generators in terms of so-called structure matrices of the Dirac formalism are…
Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking values for object attributes. This highly combinatorial problem in the field of…
The purpose of this paper is to prove that every finite set of points that can be constructed in the Euclidean plane by using a compass and a ruler can also be constructed by using unitary match-sticks in a non-simultaneous way and…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
Tables of the currently known parameters of symmetric configurations are given. Formulas for parameters of the known infinite families of symmetric configurations are presented as well. The results of the recent paper [18] are used. This…
This study first defines a new metric with normal structure on C(H,K) and then a new technique to prove fixed point theorems for families of non-expansive maps on this metric space. Indeed, it shows that the presence of a bounded orbit…
We introduce a new symbolic representation based on an original generalization of counter abstraction. Unlike classical counter abstraction (used in the analysis of parameterized systems with unordered or unstructured topologies) the new…
In this article, we present a fresh perspective on language, combining ideas from various sources, but mixed in a new synthesis. As in the minimalist program, the question is whether we can formulate an elegant formalism, a universal…
A unified construction of canonical $H^m$-nonconforming finite elements is developed for $n$-dimensional simplices for any $m, n \geq 1$. Consistency with the Morley-Wang-Xu elements [Math. Comp. 82 (2013), pp. 25-43] is maintained when $m…
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…
This paper introduces a new shape-matching methodology, combinative matching, to combine interlocking parts for geometric shape assembly. Previous methods for geometric assembly typically rely on aligning parts by finding identical surfaces…
Geometric properties of the fixed point set $Fix(f)$ of a self-mapping $f$ on a metric or a generalized metric space is an attractive issue. The set $Fix(f)$ can contain a geometric figure (a circle, an ellipse, etc.) or it can be a…
To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…
Reconfiguration paths express sequences of successive reconfiguration operations within a component-based approach allowing dynamic reconfigurations. We use constructs from regular expressions-pin particular, alternatives-to introduce…
Given an arbitrary convex symmetric n-dimensional body, we construct a natural and non-trivial continuous map which associates ellipsoids to ellipsoids, such that the Lowner-John ellipsoid of the body is its unique fixed point. A new…
For a variety with a finitely generated total coordinate ring, we describe basic geometric properties in terms of certain combinatorial structures living in its divisor class group. For example, we describe the singularities, we calculate…