We consider the problem of quadrilaterizing an orthogonal polygon P, that is to decompose P into nonoverlapping convex quadrangles without adding new vertices. In this paper we present a CREW-algorithm for this problem which runs in O time using Θ processors if the rectangle decomposition of P is given, and Θ processors if not. Furthermore we will show that the latter result is optimal if the polygon is allowed to contain holes.

Using projectivity groups, we classify some polygons with strongly minimal point rows and show in particular that no infinite quadrangle can have sharply 2-transitive projectivity groups in which the point stabilizers are abelian. In fact, we characterize the finite orthogonal quadrangles Q, Q$^-$ and Q by this property. Finally we show that the sets of points, lines and flags of any N$_1$-categorical polygon have Morley degree 1.

Some important results about art gallery theorems are proposed, starting from Chvátal’s essay, using also polygon triangulations and orthogonal polygons.

We study the class of structures formed by all the polygons over a given monoid, which is equivalent to the study of the varieties in a language containing only unary functions. We collect and amplify previous results concerning their stability and superstability. Then we characterize the regular monoids for which all these polygons are ω-stable; the question about the existence of a non regular monoid with this property is left open.

In first, we recall some properties of polygons under the action of an irregular monoid which may be written M = G ∪ I, where G is a group and I the only one ideal. Then, we completely describe monoids when G has only one orbit on I. We also describe all possible polygons and types of their elements.

In this paper, we study the genesis and evolution of geometric ideas and techniques in investigations of movable singularities of algebraic ordinary differential equations. This leads us to the work of Mihailo Petrović on algebraic differential equations and in particular the geometric ideas expressed in his polygon method from the final years of the nineteenth century, which have been left completely unnoticed by the experts. This concept, also developed independently and in a somewhat different direction by Henry Fine, generalizes (...) the famous Newton–Puiseux polygonal method and applies to algebraic ODEs rather than algebraic equations. Although remarkable, the Petrović legacy has been practically neglected in the modern literature, although the situation is less severe in the case of results of Fine. Therefore, we study the development of the ideas of Petrović and Fine and their places in contemporary mathematics. (shrink)

This manuscript explores the orthogonality constraints on configurations and orbitals subject to the property that states are mutually orthogonal. The orthogonality constraints lead to properties that affect the description of chemical systems. When states are described as linear combinations of configurations, the coefficient matrix diagonalises S−1H. Therefore, single-configuration states are only possible in one-electron systems: non-orthogonal configurations yield single-configuration states only if S−1H is diagonal, but this would violate the orthonormalisation constraint. Further, the coefficient matrix is not constrained (...) to be square. Similarly, the orbitals used to construct configurations may also be orthogonal or non-orthogonal; orbitals are only required to be mutually orthogonal at the one-electron limit. Orthogonal orbitals are generally preferred due to their mathematical and conceptual simplicity, leading to fictitious unoccupied orbitals. Since the Fock operator is orthogonality agnostic, non-orthogonal orbitals can be generated by solving the Fock equation independently for each electron; the virtual orbitals produced by this conception are true excitation orbitals as they are eigensolutions of the Fock operator. Additionally, we show that the number of molecular orbitals generated is not restricted to the number of atomic orbitals employed in the computation. This manuscript explores the mathematical relationships that need to be satisfied under the various orthogonality regimes. We also present mathematical relationships that provide results that are independent of the orthogonality approximation within a particular computational method. (shrink)

Orthogonality in model theory captures the idea of absence of non-trivial interactions between definable sets. We introduce a somewhat opposite notion of cohesiveness, capturing the idea of interaction among all parts of a given definable set. A cohesive set is indecomposable, in the sense that if it is internal to the product of two orthogonal sets, then it is internal to one of the two. We prove that a definable group in an o-minimal structure is a product of cohesive (...) orthogonal subsets. If the group has dimension one, or it is definably simple, then it is itself cohesive. As an application, we show that an abelian group definable in the disjoint union of finitely many o-minimal structures is a quotient, by a discrete normal subgroup, of a direct product of locally definable groups in the single structures. (shrink)

We present a mathematically precise derivation of some generalized orthogonality relations for the discrete series representations of SU(1,1). These orthogonality relations are applied to derive tomographical reconstruction formulas. Their physical interpretation is also discussed.

In recent years, neural networks have attracted much attention in the machine learning and the deep learning technologies. Bio-inspired functions and intelligence are also expected to process efficiently and improve existing technologies. In the visual pathway, the prominent features consist of nonlinear characteristics of squaring and rectification functions observed in the retinal and visual cortex networks, respectively. Further, adaptation is an important feature to activate the biological systems, efficiently. Recently, to overcome short-comings of the deep learning techniques, orthogonality for the (...) weights in the networks has been developed for the signal propagation and the efficient optimization of the learning. In this paper, bio-inspired asymmetric networks with nonlinear characteristics are proposed, which are derived from the retinal networks in the biological visual pathway. The asymmetric network proposed here was verified to detect the movement of the object, efficiently in our previous studies. This paper shows a new characteristic of the adaptive orthogonality in the asymmetric networks. First, it is shown that the asymmetric network with nonlinear characteristics is effective for generating orthogonality. Second, the proposed asymmetric network with Gabor filters is compared with the conventional energy model from the point of the orthogonality characteristics. Finally, the asymmetric networks with nonlinear characteristics can generate the extended orthogonal bases in independent subspaces, which are useful for classification and efficient learning. (shrink)

This paper presents arguments from empirical research and from philosophical considerations to the effect that phenomenality and content are two distinct and independent features of mental representations, which are both relational. Thus, it is argued, classical arguments that infer phenomenality from content have to be rejected. Likewise, theories that try to explain the phenomenal character of experiences by appeal to specific types of content cannot succeed. Instead, a dynamic view of consciousness has to be adopted that seeks to explain consciousness (...) by certain ways of processing representations. Therefore, only empirical methods that are able to investigate the dynamics of the mind can be used for the “quest for consciousness” proper. Moreover, the central intuitions about consciousness are best explained when phenomenality and content are clearly distinguished. (shrink)

Modal interpretations constitute a particular approach to associating dynamical variables with physical systems in quantum mechanics. Given the “quantum logical” constraints that are typically adopted by such interpretations, only certain sets of variables can be taken to be simultaneously definite-valued, and only certain sets of values can be ascribed to these variables at a given time. Moreover, each allowable set of variables and values can be uniquely specified by a single “core” projector in the Hilbert space associated with the system. (...) In general, the core projector can be one of several possibilities at a given time. In most previous modal interpretations, the different possible core projectors have formed an orthogonal set. This paper investigates the possibility of adopting a non-orthogonal set. It is demonstrated that such non-orthogonality is required if measurements for which the outcome can be predicted with probability 1 are to reveal the pre-existing value of the variable measured, an assumption which has traditionally constituted a strong motivation for the modal approach. The existing framework for modal interpretations is generalized to explicitly accommodate non-orthogonal core projectors. (shrink)

The primary aim of this original work is to provide a more in-depth insight into the relations between control parameters adjustments, learning techniques, inner swarm dynamics and possible hybridization strategies for popular swarm metaheuristic Firefly Algorithm. In this paper, a proven method, orthogonal learning, is fused with FA, specifically with its hybrid modification Firefly Particle Swarm Optimization. The parameters of the proposed Orthogonal Learning Firefly Algorithm are also initially thoroughly explored and tuned. The performance of the developed algorithm (...) is examined and compared with canonical FA and above-mentioned FFPSO. Comparisons have been conducted on well-known CEC 2017 benchmark functions, and the results have been evaluated for statistical significance using the Friedman rank test. (shrink)

We define and study the notion of an indexed frame. This is a bi-dimensional structure consisting of a Cartesian product equipped with relations which only relate pairs if they coincide in one of their components. We show that these structures are quite ubiquitous in modal logic, showing up in the literature as products of Kripke frames, subset spaces, or temporal frames for STIT logics. We show that indexed frames are completely characterised by their ‘orthogonal’ relations, and we provide their (...) sound and complete logic. Using these ‘orthogonality’ results, we provide necessary and sufficient conditions for an arbitrary Kripke frame to be isomorphic to certain well-known bi-dimensional structures. (shrink)

Let F be a signature and R a strictly orthogonal rewrite system on ground terms of F . We give an effective proof of a bounding condition for R , based on a detailed analysis of how terms are transformed during the rewrite process, which allows us to give recursive bounds on the derivation lengths of terms. We give a syntactic characterisation of the Grzegorczyk hierarchy and a rewriting schema for calculating its functions. As a consequence of this, using (...) results of Elias Tahhan–Bittar, it can be shown that, for n⩾3 , the derivation length functions for functions in Grzegorczyk class E n belong to Grzegorczyk class E n+1 . We also give recursive bounds for the derivation lengths of functions defined by parameter recursion. (shrink)

CONJECTURE: Alongside the innate physical sucking reflex for obtaining milk to be digested, decomposed and used all over the body for growth, repair, and energy, there is a genetically determined information-sucking reflex, which seeks out, sucks in, and decomposes information, which is later recombined in many ways, growing the information-processing architecture and many diverse recombinable competences.

In recent years, there has been renewed interest in the development of formal languages for describing mereological (part-whole) and topological relationships between objects in space. Typically, the non-logical primitives of these languages are properties and relations such as `x is connected' or `x is a part of y', and the entities over which their variables range are, accordingly, not points, but regions: spatial entities other than regions are admitted, if at all, only as logical constructs of regions. This paper considers (...) two first-order mereotopological languages, and investigates their expressive power. It turns out that these languages, notwithstanding the simplicity of their primitives, are surprisingly expressive. In particular, it is shown that infinitary versions of these languages are adequate to express (in a sense made precise below) all topological relations over the domain of polygons in the closed plane. (shrink)

This paper begins by asking a simple question: can a farmer own and fully utilise precisely five tractors and precisely six tractors at the same time? Of course not. He can own five or he can own six but he cannot own five and six at the same. The answer to this simple question eventually led this author to Alfred Marshall's historically-ignored, linguistically-depicted 'cardboard model' where my goal was to construct a picture based on his written words. More precisely, in (...) this paper the overall goal is to convert Marshall's ('three-dimensional') words into a three-dimensional picture so that the full import of his insight can be appreciated by all readers. After a brief digression necessary to introduce Euclidean three-dimensional space, plus a brief digression to illustrate the pictorial problem with extant theory, the paper turns to Marshall's historically- ignored words. Specifically, it slowly constructs a visual depiction of Marshall's 'cardboard model'. Unfortunately (for all purveyors of extant economic theory), this visual depiction suddenly opens the door to all manner of Copernican heresy. For example, it suddenly becomes obvious that we can join the lowest points on a firm's series of SRAC curves and thereby form its LRAC curve; it suddenly becomes obvious that the firm's series of SRAC curves only appear to intersect because mainstream theory has naively forced our three-dimensional economic reality into a two-dimensional economic sketch; and it suddenly becomes obvious that a two-dimensional sketch is analytically useless because the 'short run' (SR) never turns into the 'long run' (LR) no matter how long we wait. (shrink)

Several authors have suggested that a more parsimonious and conceptually elegant treatment of everyday mereological and topological reasoning can be obtained by adopting a spatial ontology in which regions, not points, are the primitive entities. This paper challenges this suggestion for mereotopological reasoning in two-dimensional space. Our strategy is to define a mereotopological language together with a familiar, point-based interpretation. It is proposed that, to be practically useful, any alternative region-based spatial ontology must support the same sentences in our language (...) as this familiar interpretation. This proposal has the merit of transforming a vague, open-ended question about ontologies for practical mereotopological reasoning into a precise question in model theory. We show that (a version of) the familiar interpretation is countable and atomic, and therefore prime. We conclude that useful alternative ontologies of the plane are, if anything, less parsimonious than the one which they are supposed to replace. (shrink)

In recent years, there has been renewed interest in the development of formal languages for describing mereological (part-whole) and topological relationships between objects in space. Typically, the non-logical primitives of these languages are properties and relations such as ‘xis connected’ or ‘xis a part ofy’, and the entities over which their variables range are, accordingly, notpoints, butregions: spatial entities other than regions are admitted, if at all, only as logical constructs of regions. This paper considers two first-order mereotopological languages, and (...) investigates their expressive power. It turns out that these languages, notwithstanding the simplicity of their primitives, are surprisingly expressive. In particular, it is shown that infinitary versions of these languages are adequate to express (in a sense made precise below) all topological relations over the domain of polygons in the closed plane. (shrink)

We introduce and study a variety of modal logics of parallelism, orthogonality, and affine geometries, for which we establish several completeness, decidability and complexity results and state a number of related open, and apparently difficult problems. We also demonstrate that lack of the finite model property of modal logics for sufficiently rich affine or projective geometries (incl. the real affine and projective planes) is a rather common phenomenon.

It is conjectured that humans and some other altricial species instead use innate mechanisms for decomposing situations into components that can be explicitly learnt about, and stored in such a way that the competence can be re-used in combination with other learnt competences, in perceiving novel situations and performing novel actions.

An artificial general intelligence (AGI) might have an instrumental drive to modify its utility function to improve its ability to cooperate, bargain, promise, threaten, and resist and engage in blackmail. Such an AGI would necessarily have a utility function that was at least partially observable and that was influenced by how other agents chose to interact with it. This instrumental drive would conflict with the strong orthogonality thesis since the modifications would be influenced by the AGI’s intelligence. AGIs in highly (...) competitive environments might converge to having nearly the same utility function, one optimized to favorably influencing other agents through game theory. Nothing in our analysis weakens arguments concerning the risks of AGI. (shrink)

Some properties are discussed of regular polygons that may result from angular homeostatic processes in stable orbit. To characterize these homeostatic polygons we need to discuss the winding number, the sidedness (integer, fractional and irrational), multiplicity, envelopes, and density. A regular (i.e., equilateral, equiangular) polygon may be closed in one revolution about its unique center, in multiple revolutions, or not at all. A homeostatic polygon can be generated only if all vertices are included in a single polygon, (...) which occurs if and only if the number of vertices and the number of revolutions required to complete the polygon are relatively prime. For the homeostatic polygon to have a finite number of sides (without repeating itself) the angle subtended by any two successive vertices at the center must be a rational multiple of 2. Biological implications of these properties are illustrated. (shrink)

In quantum mechanics it is usually assumed that mutually exclusives states of affairs must be represented by orthogonal vectors. Recent attempts to solve the measurement problem, most notably the GRW theory, require the relaxation of this assumption. It is shown that a consequence of relaxing this assumption is that arithmatic does not apply to ordinary macroscopic objects. It is argued that such a radical move is unwarranted given the current state of understanding of the foundations of quantum mechanics.

Orthogonality between two stably embedded definable sets is preserved under the addition of constants.

The standard argument to the conclusion that artificial intelligence (AI) constitutes an existential risk for the human species uses two premises: (1) AI may reach superintelligent levels, at which point we humans lose control (the ‘singularity claim’); (2) Any level of intelligence can go along with any goal (the ‘orthogonality thesis’). We find that the singularity claim requires a notion of ‘general intelligence’, while the orthogonality thesis requires a notion of ‘instrumental intelligence’. If this interpretation is correct, they cannot be (...) joined as premises and the argument for the existential risk of AI turns out invalid. If the interpretation is incorrect and both premises use the same notion of intelligence, then at least one of the premises is false and the orthogonality thesis remains itself orthogonal to the argument to existential risk from AI. In either case, the standard argument for existential risk from AI is not sound.—Having said that, there remains a risk of instrumental AI to cause very significant damage if designed or used badly, though this is not due to superintelligence or a singularity. (shrink)

Traditional models of skill learning posit that skilled action unfolds in an automatic manner and that control will prove deleterious to movement and performance proficiency. These perspectives assume that automated processes are characterised by low levels of control and vice versa. By contrast, a number of authors have recently put forward hybrid theories of skilled action which have sought to capture the close integration between fine-grained automatic motor routines and intentional states. Drawing heavily on the work of Bebko et al. (...) and Christensen et al., we argue that controlled and automated processes must operate in parallel if skilled performers are to address the wide range of challenges that they are faced with in training and competition. More specifically, we show how skilled performers use controlled processes to update and improve motor execution in training contexts and to stabilise performance under pressurised conditions. (shrink)

In this paper the author presents a new form of hexagon and the solution of the open problem of classifying plane hexagons. In particular are illustrated the forms of crossed and simple n -gons for n = 3, 4, 5, 6 and also the forms of simple ones for n = 7, 8, 9. A graphic way to construct new forms of polygons is illustrated.

We show that given a simple Polygon P it is NP-hard to determine the smallest α ∈ [0, π] such that P can be illuminated by α-vertexlights, if we place exactly one α-vertexlight in each vertex of P.

Model organisms, the use of green fluorescent proteins, and orthogonal transfer RNA are examples of artificial causes being used in biology. Recent work characterizing the research interests of biologists in terms of a common set of values has ruled out artificial causes as biologically interesting. For instance, Kenneth Waters argues that biologists are primarily interested in causes that actually obtain. Similarly, Marcel Weber argues that biologists are primarily concerned with biologically normal interventions. Both views express a widely received attitude (...) about the interests and goals of biologists as being primarily concerned with the contingent facts of our world. While I agree with this general attitude about the contingent nature of biology, I argue that neither view fully accounts for the diversity that distinguishes the discipline. Along with actual and biologically normal causes, biologists are also interested in artificial causes for technological and observational purposes. I maintain that research interest in artificial causes provides some pragmatic reasons for thinking that research programs in cellular biology aren’t driven by a common core set of values. (shrink)

We present a version of system Fω, called image, in which the layer of type constructors is essentially the traditional one of Fω, whereas provability of types is classical. The proof-term calculus accounting for the classical reasoning is a variant of Barbanera and Berardi’s symmetric λ-calculus.We prove that the whole calculus is strongly normalising. For the layer of type constructors, we use Tait and Girard’s reducibility method combined with orthogonality techniques. For the layer of terms, we use Barbanera and Berardi’s (...) method based on a symmetric notion of reducibility candidate. We prove that orthogonality does not capture the fixpoint construction of symmetric candidates.We establish the consistency of image, and relate the calculus to the traditional system Fω, also when the latter is extended with axioms for classical logic. (shrink)