direct generalization
Recently Published Documents


TOTAL DOCUMENTS

28
(FIVE YEARS 3)

H-INDEX

8
(FIVE YEARS 0)

PLoS ONE ◽  
2020 ◽  
Vol 15 (11) ◽  
pp. e0240046
Author(s):  
ChunJing Li ◽  
Yun Li ◽  
Xue Ding ◽  
XiaoGang Dong

This paper propose a direct generalization quantile regression estimation method (DGQR estimation) for quantile regression with varying-coefficient models with interval censored data, which is a direct generalization for complete observed data. The consistency and asymptotic normality properties of the estimators are obtained. The proposed method has the advantage that does not require the censoring vectors to be identically distributed. The effectiveness of the method is verified by some simulation studies and a real data example.


2020 ◽  
Vol 34 (02) ◽  
pp. 1814-1821
Author(s):  
Xiaohui Bei ◽  
Zihao Li ◽  
Jinyan Liu ◽  
Shengxin Liu ◽  
Xinhang Lu

We study the problem of fair division when the resources contain both divisible and indivisible goods. Classic fairness notions such as envy-freeness (EF) and envy-freeness up to one good (EF1) cannot be directly applied to the mixed goods setting. In this work, we propose a new fairness notion envy-freeness for mixed goods (EFM), which is a direct generalization of both EF and EF1 to the mixed goods setting. We prove that an EFM allocation always exists for any number of agents. We also propose efficient algorithms to compute an EFM allocation for two agents and for n agents with piecewise linear valuations over the divisible goods. Finally, we relax the envy-free requirement, instead asking for ϵ-envy-freeness for mixed goods (ϵ-EFM), and present an algorithm that finds an ϵ-EFM allocation in time polynomial in the number of agents, the number of indivisible goods, and 1/ϵ.


2020 ◽  
Vol 63 (4) ◽  
pp. 813-824
Author(s):  
Zsigmond Tarcsay ◽  
Tamás Titkos

AbstractThe aim of this paper is to develop an approach to obtain self-adjoint extensions of symmetric operators acting on anti-dual pairs. The main advantage of such a result is that it can be applied for structures not carrying a Hilbert space structure or a normable topology. In fact, we will show how hermitian extensions of linear functionals of involutive algebras can be governed by means of their induced operators. As an operator theoretic application, we provide a direct generalization of Parrott’s theorem on contractive completion of 2 by 2 block operator-valued matrices. To exhibit the applicability in noncommutative integration, we characterize hermitian extendibility of symmetric functionals defined on a left ideal of a $C^{\ast }$-algebra.


2018 ◽  
Vol 19 (2) ◽  
pp. 421-450 ◽  
Author(s):  
Stephen Scully

Let $q$ be an anisotropic quadratic form defined over a general field $F$. In this article, we formulate a new upper bound for the isotropy index of $q$ after scalar extension to the function field of an arbitrary quadric. On the one hand, this bound offers a refinement of an important bound established in earlier work of Karpenko–Merkurjev and Totaro; on the other hand, it is a direct generalization of Karpenko’s theorem on the possible values of the first higher isotropy index. We prove its validity in two key cases: (i) the case where $\text{char}(F)\neq 2$, and (ii) the case where $\text{char}(F)=2$ and $q$ is quasilinear (i.e., diagonalizable). The two cases are treated separately using completely different approaches, the first being algebraic–geometric, and the second being purely algebraic.


10.29007/mtcs ◽  
2018 ◽  
Author(s):  
Richard Ball

In analysis, truncation is the operation of replacing a nonnegative real-valued function a (x) by its pointwise meet a (x) ∧ 1 with the constant $1$ function. A vector lattice A is said to be closed under truncation if a ∧ 1 ∈ A for all a ∈ A+. Note that A need notcontain 1 itself.Truncation is fundamental to analysis. To give only one example, Lebesgue integration generalizes beautifully to any vector lattice of real-valued functions on a set X, provided the vector lattice is closed under truncation. But vector lattices lacking this property may have integrals which cannot be represented by any measure on X. Nevertheless, when the integral is formulated in a context broader than RX, for example in pointfree analysis, the question oftruncation inevitably arises.What is truncation, or more properly, what are its essential properties? In this paper we answer this question by providing the appropriate axiomatization, and then go on to present several representation theorems. The first is adirect generalization of the classical Yosida representation of an archimedean vector lattice with order unit. The second is a direct generalization of Madden's pointfree representation of archimedean vector lattices. If time permits, we briefly discuss a third sheaf representation which has no direct antecedent in the literature.However, in all three representations the lack of a unit forces a crucial distinction from the corresponding unital representation theorem. The universal object in each case is some sort of family of continuous real-valued functions. The difference is that these functions must vanish at a specified point of the underlying space or locale or sheaf space. With that adjustment, the generalization from units to truncations goes remarkably smoothly.


2016 ◽  
Vol 13 (09) ◽  
pp. 1650106 ◽  
Author(s):  
Peng Huang ◽  
Fang-Fang Yuan

For teleparallel gravity in four dimensions, Lucas and Pereira have shown that its action can be constructed via a generalized Hodge dual for torsion tensor. In this paper, we demonstrate that a direct generalization of this approach to other dimensions fails due to the fact that no generalized Hodge dual operator could be given in general dimensions. Furthermore, if one enforces the definition of a generalized Hodge dual to be consistent with the action of teleparallel gravity in general dimensions, the basic identity for any sensible Hodge dual would require an ad hoc definition for the second Hodge dual operation which is totally unexpected. Therefore, we conclude that at least for the torsion tensor, the observation of Lucas and Pereira only applies to four dimensions.


Author(s):  
Nobuhiro Honda

AbstractIn this paper we investigate Moishezon twistor spaces which have a structure of double covering over a very simple rational threefold. These spaces can be regarded as a direct generalization of the twistor spaces studied in [J. Differential Geom. 36 (1992), 451–491] and [Compos. Math. 82 (1992), 25–55] to the case of arbitrary signature. In particular, the branch divisor of the double covering is a cut of the rational threefold by a single quartic hypersurface. We determine a defining equation of the hypersurface in an explicit form. We also show that these twistor spaces interpolate LeBrun twistor spaces and the twistor spaces constructed in [J. Differential Geom. 82 (2009), 411–444].


2015 ◽  
Vol 22 (4) ◽  
Author(s):  
David Kighuradze

AbstractIn this paper we give a direct generalization of Carleson–Ullrich's theorem in Besov spaces and geometric characterization of removable sets for harmonic functions in those spaces in terms of Hausdorff measure. In particular, for a compact set


2010 ◽  
Vol 11 (1) ◽  
pp. 33-63 ◽  
Author(s):  
MANH THANG NGUYEN ◽  
DANNY DE SCHREYE ◽  
JÜRGEN GIESL ◽  
PETER SCHNEIDER-KAMP

AbstractOur goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt termination analysis techniques based on polynomial interpretations—very well known in the context of term rewrite systems—to obtain new (nontransformational) termination analysis techniques for definite logic programs (LPs). This leads to an approach that can be seen as a direct generalization of the traditional techniques in termination analysis of LPs, where linear norms and level mappings are used. Our extension generalizes these to arbitrary polynomials. We extend a number of standard concepts and results on termination analysis to the context of polynomial interpretations. We also propose a constraint-based approach for automatically generating polynomial interpretations that satisfy the termination conditions. Based on this approach, we implemented a new tool, called Polytool, for automatic termination analysis of LPs.


Sign in / Sign up

Export Citation Format

Share Document