A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

A Characterization of Semirings Which Are Subdirect Products of a Distributive Lattice and a Ring

E -inversive semiring and a Clifford semiring and show that a semiring S is a subdirect product of a distributive lattice and a ring if and only if S is an E-inversive strong distributive lattice of halfrings. Further a Clifford semiring which is, in fact, an inversive subdirect product of a distributive lattice and a ring, is characterized as a strong distributive lattice of rings. Finally, as a consequence of these results we extend a result of Galbiati and Veronesi [2] in the case of Boolean semirings.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

Cayley hypergraphs and Cayley hypermaps

In this paper, we introduce a Cayley hypergraph which is a generalization of a Cayley graph, and a Cayley hypermap which is a generalization of a Cayley map. We investigate some properties of Cayley hypergraphs and Cayley hypermaps, describe the automorphism group of a Cayley hypermap and determine when a Cayley hypermap is regular.     

On the intersections of circuits and cocircuits in matroids

Seymour has shown that a matroid has a triad, that is, a 3-element set which is the intersection of a circuit and a cocircuit, if and only if it is non-binary. In this paper we determine precisely when a matroidM has a quad, a 4-element set which is the intersection of a circuit and a cocircuit. We also show that this will occur ifM has a circuit and a cocircuit meeting in more than four elements. In addition, we prove that if a 3-connected matroid has a quad, then every pair of elements is in a quad. The corresponding result for triads was proved by Seymour.     

Null Extensions and Generalized Inflations of Brandt Semigroups

Clarke and Monzo defined in [3] a construction called a generalized inflation of a semigroup. It is always the case that any inflation of a semigroup is a generalized inflation, and any generalized inflation of a semigroup is a null extension of the semigroup. Clarke and Monzo proved that any associative null extension of a base semigroup which is a union of groups is in fact a generalized inflation. In this paper we study null extensions and generalized inflations of Brandt semigroups. We first prove that any generalized inflation of a Brandt semigroup is actually an inflation of the semigroup. This answers a question posed by Clarke and Monzo in [3]. Then we characterize associative null extensions of Brandt semigroups, and show that there are associative null extensions of Brandt semigroups which are not generalized inflations.     

Hybrid iterative scheme for generalized equilibrium problems and fixed point problems of finite family of nonexpansive mappings

In this paper, we introduce a new mapping and a Hybrid iterative scheme for finding a common element of the set of solutions of a generalized equilibrium problem and the set of common fixed points of a finite family of nonexpansive mappings in a Hilbert space. Then, we prove the strong convergence of the proposed iterative algorithm to a common fixed point of a finite family of nonexpansive mappings which is a solution of the generalized equilibrium problem. The results obtained in this paper extend the recent ones of Takahashi and Takahashi [S. Takahashi, W. Takahashi, Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space, Nonlinear Anal. 69 (2008) 1025–1033].     

Counting dissections into integral squares

A squared rectangle is a rectangle dissected into squares. Similarly a rectangled rectangle is a rectangle dissected into rectangles. The classic paper ‘The dissection of rectangles into squares’ of Brooks, Smith, Stone and Tutte described a beautiful connection between squared rectangles and harmonic functions. In this paper we count dissections of a rectangle into a set of integral squares or a set of integral rectangles. Here, some squares and rectangles may have the same size. We introduce a method involving a recurrence relation of large sized matrices to enumerate squared and rectangled rectangles of a given sized rectangle and propose the asymptotic behavior of their growth rates.     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

弱辫子T-范畴（英文）

Recently Turaev generalized the notion of a tensor category to that of a crossed group category.In[5]the authors constructed the representation category Rep(H) of a T-coalgebra H.In[2]the authors introduced the notions of a weak tensor category to characterize a weak bialgebra and a weak Hopf algebra.This paper is based on these ideas to naturally introduce the notions of a weak T-category and a weak braided T-category which are not under the usual way and prove that the categories of representations of a weak T-coalgebra and a weak braided T-coalgebra are a weak T-category and a weak braided T-category respectively.Furthermore we also discuss some properties of weak T-category.     

DC programming techniques for solving a class of nonlinear bilevel programs

We propose a method for finding a global solution of a class of nonlinear bilevel programs, in which the objective function in the first level is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a quadratic programming problem. This method is a combination of the local algorithm DCA in DC programming with a branch and bound scheme well known in discrete and global optimization. Computational results on a class of quadratic bilevel programs are reported.     

Multi-server queueing system with a generalized phase-type service time distribution as a model of call center with a call-back option

A multi-server queueing system with a Markovian arrival process and finite and infinite buffers to model a call center with a call-back option is investigated. If all servers are busy during the customer arrival epoch, the customer may leave the system forever or move to the buffer (such a customer is referred to as a real customer), or, alternatively, request for call-back (such a customer is referred to as a virtual customer). During a waiting period, a real customer can be impatient and may leave the system without service or request for call-back (becomes a virtual customer). The service time of a customer and the dial time to a virtual customer for a server have a phase-type distribution. To simplify the investigation of the system we introduce the notion of a generalized phase-type service time distribution. We determine the stationary distribution of the system states and derive the Laplace–Stieltjes transforms of the sojourn and waiting time distributions for real and virtual customers. Some key performance measures are calculated and numerical results are presented.     

Noncommutative spectral decomposition with quasideterminant

We develop a noncommutative analogue of the spectral decomposition with the quasideterminant defined by I. Gelfand and V. Retakh. In this theory, by introducing a noncommutative Lagrange interpolating polynomial and combining a noncommutative Cayley-Hamilton's theorem and an identity given by a Vandermonde-like quasideterminant, we can systematically calculate a function of a matrix even if it has noncommutative entries. As examples, the noncommutative spectral decomposition and the exponential matrices of a quaternionic matrix and of a matrix with entries being harmonic oscillators are given.     

The finite rank perturbations of the product of Hankel and Toeplitz operators

In this paper we completely characterize when the product of a Hankel operator and a Toeplitz operator on the Hardy space is a finite rank perturbation of a Hankel operator, and when the commutator of a Hankel operator and a Toeplitz operators has finite rank.     

Global efficiency in multiobjective programming *

In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed     

On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width

Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework and tools for easy design of dynamic algorithms running directly on a rank-decomposition of a graph (on contrary to the usual approach which translates a rank-decomposition into a clique-width expression, with a possible exponential jump in the parameter). The main advantage of this framework is a fine control over the runtime dependency on the rank-width parameter. Our new approach is linked to a work of Courcelle and Kanté [7] who first proposed algebraic expressions with a so-called bilinear graph product as a better way of handling rank-decompositions, and to a parallel recent research of Bui-Xuan, Telle and Vatshelle.     

Topological representation of posets

There is a canonical imbedding of a poset into a complete Boolean lattice and hence into a Boolean lattice. This gives it a representation as a collection of clopen sets of a Boolean space. There are reflective functions from a category of distributive posets to the subcategories of distributive and Boolean lattices and consequently a topological dual equivalence that extends the Stone duality of Boolean lattices.Presented by B. Jonsson.     

Rings with Elementary Reduction of Matrices

We establish necessary and sufficient conditions under which a quasi-Euclidean ring coincides with a ring with elementary reduction of matrices. We prove that a semilocal Bézout ring is a ring with elementary reduction of matrices and show that a 2-stage Euclidean domain is also a ring with elementary reduction of matrices. We formulate and prove a criterion for the existence of solutions of a matrix equation of a special type and write these solutions in an explicit form.     

Subgradient Projectors: Extensions,Theory, and Characterizations

Subgradient projectors play an important role in optimization and for solving convex feasibility problems. For every locally Lipschitz function, we can define a subgradient projector via generalized subgradients even if the function is not convex. The paper consists of three parts. In the first part, we study basic properties of subgradient projectors and give characterizations when a subgradient projector is a cutter, a local cutter, or a quasi-nonexpansive mapping. We present global and local convergence analyses of subgradent projectors. Many examples are provided to illustrate the theory. In the second part, we investigate the relationship between the subgradient projector of a prox-regular function and the subgradient projector of its Moreau envelope. We also characterize when a mapping is the subgradient projector of a convex function. In the third part, we focus on linearity properties of subgradient projectors. We show that, under appropriate conditions, a linear operator is a subgradient projector of a convex function if and only if it is a convex combination of the identity operator and a projection operator onto a subspace. In general, neither a convex combination nor a composition of subgradient projectors of convex functions is a subgradient projector of a convex function.