An arithmetical view to first-order logic

A value space is a topological algebra B equipped with a non-empty family of continuous quantifiers :B^∗→B. We will describe first-order logic on the basis of B. Operations of B are used as connectives and its relations are used to define statements. We prove under some normality conditions on the value space that any theory in the new setting can be represented by a classical first-order theory.     

Preservation theorems in linear continuous logic

Linear continuous logic is the fragment of continuous logic obtained by restricting connectives to addition and scalar multiplications. Most results in the full continuous logic have a counterpart in this fragment. In particular a linear form of the compactness theorem holds. We prove this variant and use it to deduce some basic preservation theorems.     

Cohen–Macaulayness and Limit Behavior of Depth for Powers of Cover Ideals

Let 𝕂 be a field, and let R = 𝕂[x ₁,…, x _n ] be the polynomial ring over 𝕂 in n indeterminates x ₁,…, x _n . Let G be a graph with vertex-set {x ₁,…, x _n }, and let J be the cover ideal of G in R. For a given positive integer k, we denote the kth symbolic power and the kth bracket power of J by J ^(k) and J ^[k], respectively. In this paper, we give necessary and sufficient conditions for R/J ^k , R/J ^(k), and R/J ^[k] to be Cohen–Macaulay. We also study the limit behavior of the depths of these rings.     

Maximum flow problem on dynamic generative network flows with time-varying bounds

This paper considers a new class of network flows, called dynamic generative network flows in which, the flow commodity is dynamically generated at a source node and dynamically consumed at a sink node and the arc-flow bounds are time dependent. Then the maximum dynamic flow problem in such networks for a pre-specified time horizon T is defined and mathematically formulated in both arc flow and path flow presentations. By exploiting the special structure of the problem, an efficient algorithm is developed to solve the general form of the dynamic problem as a minimum cost static flow problem.     

Efficiency analysis in two-stage structures using fuzzy data envelopment analysis

Two-stage data envelopment analysis (TsDEA) models evaluate the performance of a set of production systems in which each system includes two operational stages. Taking into account the internal structures is commonly found in many situations such as seller-buyer supply chain, health care provision and environmental management. Contrary to conventional DEA models as a black-box structure, TsDEA provides further insight into sources of inefficiencies and a more informative basis for performance evaluation. In addition, ignoring the qualitative and imprecise data leads to distorted evaluations, both for the subunits and the system efficiency. We present the fuzzy input and output-oriented TsDEA models to calculate the global and pure technical efficiencies of a system and sub-processes when some data are fuzzy. To this end, we propose a possibilistic programming problem and then convert it into a deterministic interval programming problem using the α-level based method. The proposed method preserves the link between two stages in the sense that the total efficiency of the system is equal to the product of the efficiencies derived from two stages. In addition to the study of technical efficiency, this research includes two further contributions to the ancillary literature; firstly, we minutely discuss the efficiency decompositions to indicate the sources of inefficiency and secondly, we present a method for ranking the efficient units in a fuzzy environment. An empirical illustration is also utilised to show the applicability of the proposed technique.     

A generalization of Eagon–Reiner’s theorem and a characterization of bi-CMt bipartite and chordal graphs

We give a generalization of Eagon-Reiner’s theorem relating Betti numbers of the Stanley-Reisner ideal of a simplicial complex and the CM_t property of its Alexander dual. Then we characterize bi-CM_t bipartite graphs and bi-CM_t chordal graphs. These are generalizations of recent results due to Herzog and Rahimi.     

More on boundary conditions for warped AdS $$_3$$ in GMG

The European Physical Journal C - We consider a $$U(1)_{B-L}$$ model with a $$Z^prime $$ portal Dirac fermion dark matter (DM) $$chi $$ of low mass which couples very weakly to the $$B - L$$...