Related papers: A Johnson-Kist type representation for truncated v…
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…
We resort to the concept of turns to provide a geometrical representation of the action of any lossless multilayer, which can be considered as the analogous in the unit disk to the sliding vectors in Euclidean geometry. This construction…
Quantum fractal superlattices are microelectronic devices consisting of a series of thin layers of two semiconductor materials deposited alternately on each other over a substrate following the rules of construction of a fractal set, here,…
The goal of this paper is to deepen the study of multiplicative lattices in the sense of Facchini, Finocchiaro and Janelidze. We provide a sort of Prime Ideal Principle that guarantees that maximal implies prime in a variety of cases (among…
The Sasaki projection was introduced as a mapping from the lattice of closed subspaces of a Hilbert space onto one of its segments. To use this projection and its dual so-called Sasaki operations were introduced by the second two authors.…
This work presents a computational method for the design of architected truss lattice materials where each strut can be made of one of a set of available materials. We design the lattices to extremize effective properties. As customary in…
In this paper we study the existence of sufficiently regular representations of Hamilton-Jacobi equations in the optimal control theory with unbounded control set. We use a new method to construct representations for a wide class of…
We consider continuous-state and continuous-time control problems where the admissible trajectories of the system are constrained to remain on a union of half-planes which share a common straight line. This set will be named a junction. We…
We introduce the notions of multi-suprema and multi-infima for vector spaces equipped with a collection of wedges, generalizing the notions of suprema and infima in ordered vector spaces. Multi-lattices are vector spaces closed under…
Universal representation of geometric patterns of disordered matters is investigated with the aid of general topology. By utilizing the result obtained in the previous study (S. Ohmori, et.al., Phys. Scr. 94, 105213 (2019)) that any…
We consider the locus of sections of a vector bundle on a projective scheme that vanish in higher dimension than expected. We show that after applying a high enough twist, any maximal component of this locus consists entirely of sections…
Vector fields are a highly abstract physical concept that is often taught using visualizations. Although vector representations are particularly suitable for visualizing quantitative data, they are often confusing, especially when…
We use Menke's JSJ-type decomposition theorem for symplectic fillings to reduce the classification of strong and exact symplectic fillings of virtually overtwisted torus bundles to the same problem for tight lens spaces. For virtually…
We introduce a concept of multiplicity lattices of 2-multiarrangements, determine the combinatorics and geometry of that lattice, and give a criterion and method to construct a basis for derivation modules effectively.
We exhibit a class of "relatively curved" $\vec{\gamma}(t) := (\gamma_1(t),\dots,\gamma_n(t))$, so that the pertaining multi-linear maximal function satisfies the sharp range of H\"{o}lder exponents, \[ \left\| \sup_{r > 0} \ \frac{1}{r}…
Truncated convex models (TCM) are a special case of pairwise random fields that have been widely used in computer vision. However, by restricting the order of the potentials to be at most two, they fail to capture useful image statistics.…
We introduce a rotation-invariant representation of planar shapes. In particular, this representation encodes shapes as vectors such that the Euclidean distance between them serves as a valid shape distance. For standardized, star-shaped…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
We develop the theory of truncated wedge schemes, a higher dimensional analog of jet schemes. We prove some basic properties and give an irreducibility criterion for truncated wedge schemes of a locally complete intersection variety…
It is shown that the set of all finitary consequence operators defined on any nonempty language is a join-complete lattice. This result is applied to various collections of physical theories to obtain an unrestricted supremum unification.