共查询到20条相似文献,搜索用时 31 毫秒
1.
O. Chein E. G. Goodaire 《Abhandlungen aus dem Mathematischen Seminar der Universit?t Hamburg》2005,75(1):245-255
In [5, 6], the second author and D. A. ROBINSON initiated a study of non-Moufang Bol loops with the property that over a field,
necessarily of characteristic 2, their loop rings satisfy the right, but not the left, Bol identity. They called such loops
SRAR and showed that the family of SRAR loops includes those Bol loops which have a unique non-identity commutator/associator.
In [4, 2], the current authors presented a construction for a new class of Bol loops denoted L(B,m,n,r,s,t,z,w) with initial
data a given (possibly associative) Bol loop B, elements, r, s, t, z and w in the centre of B, and integers m and n. 相似文献
2.
3.
4.
We shall present here results concerning the metric entropy of
spaces of linear and nonlinear approximation under very general conditions. Our
first result computes the metric entropy of the linear and m-terms
approximation classes according to a quasi-greedy basis verifying the
Temlyakov property. This theorem shows that the second index r is not visible
throughout the behavior of the metric entropy. However, metric entropy does
discriminate between linear and nonlinear approximation.
Our second result extends and refines a result
obtained in a Hilbertian framework by Donoho, proving that under orthosymmetry
conditions, m-terms approximation classes are characterized by the metric
entropy. Since these theorems are given under the general context of quasi-greedy
bases verifying the Temlyakov property, they have a large spectrum of
applications. For instance, it is proved in the last section that they can be
applied in the case of
L
p
norms for
R
d
for 1 < p < \infty.
We show that the lower bounds needed for this paper in fact follow
from quite simple
large deviation inequalities concerning hypergeometric or binomial distributions.
To prove the upper bounds, we provide a very simple universal coding
based on a thresholding-quantizing constructive procedure. 相似文献
5.
In 1857, Cayley showed that certain sequences, now called Cayley compositions, are equinumerous with certain partitions into powers of 2. In this paper we give a simple bijective proof of this result and a geometric generalization to equality of Ehrhart polynomials between two convex polytopes. We then apply our results to give a new proof of Braun?s conjecture proved recently by the authors [15]. 相似文献
6.
Lorenzo Carlucci 《Mathematical Logic Quarterly》2005,51(4):342-350
We define a direct translation from finite rooted trees to finite natural functions which shows that the Worm Principle introduced by Lev Beklemishev is equivalent to a very slight variant of the well‐known Kirby‐Paris' Hydra Game. We further show that the elements in a reduction sequence of the Worm Principle determine a bad sequence in the well‐quasi‐ordering of finite sequences of natural numbers with respect to Friedman's gapembeddability. A characterization of gap‐embeddability in terms of provability logic due to Lev Beklemishev is also presented. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
7.
Vladimir D. Tonchev 《Geometriae Dedicata》1993,48(3):295-308
It is proved that a quasi-symmetric design with theSymmetric Difference Property (SDP) is uniquely embeddable as a derived or a residual design into a symmetric SDP design. Alternatively, any quasi-symmetric SDP design is characterized as the design formed by the minimum weight vectors in a binary code spanned by the simplex code and the incidence vector of a point set in PG(2m-1, 2) that intersects every hyperplane in one of two prescribed numbers of points. Applications of these results for the classification of point sets in PG(2m-1, 2) with the same intersection properties as an elliptic or a hyperbolic quadric, as well as the classification of codes achieving the Grey-Rankin bound are discussed. 相似文献
8.
A graph is t‐tough if the number of components of G\S is at most |S|/t for every cutset S ⊆ V (G). A k‐walk in a graph is a spanning closed walk using each vertex at most k times. When k = 1, a 1‐walk is a Hamilton cycle, and a longstanding conjecture by Chvátal is that every sufficiently tough graph has a 1‐walk. When k ≥ 3, Jackson and Wormald used a result of Win to show that every sufficiently tough graph has a k‐walk. We fill in the gap between k = 1 and k ≥ 3 by showing that, when k = 2, every sufficiently tough (specifically, 4‐tough) graph has a 2‐walk. To do this we first provide a new proof for and generalize a result by Win on the existence of a k‐tree, a spanning tree with every vertex of degree at most k. We also provide new examples of tough graphs with no k‐walk for k ≥ 2. © 2000 John Wiley & Sons, Inc. J Graph Theory 33:125–137, 2000 相似文献
9.
Alex Bonutti Fabio De Cesco Luca Di Gaspero Andrea Schaerf 《Annals of Operations Research》2012,194(1):59-70
We propose a set of formulations for the Curriculum-Based Course Timetabling problem, with the aim of “capturing” many real-world
formulations, and thus encouraging researchers to “reduce” their specific problems to one of them, gaining the opportunity
to compare and assess their results. This work is accompanied by a web application that maintains all the necessary infrastructures for benchmarking: validators, data formats, instances, reference scores, lower bounds, solutions, and visualizers. All instances
proposed here are based on real data from various universities and they represent a variety of possible situations. 相似文献
10.
M.F. Cantley 《European Journal of Operational Research》1985,19(3):399-400
We consider two queues in series with input to each queue, which can be controlled by accepting or rejecting arriving customers. The objective is to maximize the discounted or average expected net benefit over a finite or infinite horizon, where net benefit is composed of (random) rewards for entering customers minus holding costs assessed against the customers at each queue. Provided that it costs more to hold a customer at the first queue than at the second, we show that an optimal policy is monotonic in the following senses: Adding a customer to either queue makes it less likely that we will accept a new customer into either queue; moreover moving a customer from the first queue to the second makes it more (less) likely that we will accept a new customer into the first (second) queue. Our model has policy implications for flow control in communication systems, industrial job shops, and traffic-flow systems. We comment on the relation between the control policies implied by our model and those proposed in the communicationa literature. 相似文献
11.
Harvey W. Becher 《Historia Mathematica》1980,7(4):389-400
In a recent article, J. M. Dubbey [Historia Mathematica 4 (1977), 295–302] showed that George Peacock's A Treatise on Algebra (1830) was similar to an unpublished work written by Charles Babbage in 1821. Evidently perplexed about the absence of a dispute over priority, Dubbey concluded that Peacock had unconsciously assimilated Babbage's ideas, and that Babbage was too busy with other activities to be concerned. The thesis of this article is that the innovative aspects of the work of both Babbage and Peacock are extensions of ideas put forth in 1803 by Robert Woodhouse, and that probably neither Babbage nor Peacock was overly concerned with acknowledgments because their approach to algebra was not unique at Cambridge. 相似文献
12.
采用CSSCI数据库中收录的全部期刊数据,通过相关分析、区间数据主成分分析等方法建立模型,客观地对整个数据库中期刊的整体特征进行全面、系统的分析,探寻其中的特征、规律以及原因,提出了办好学术期刊的一些方式方法. 相似文献
13.
In thIs paper we prove the existence and uniqueness of the solution to a linearized, two dimensional, steady state, viscous, compressible Navier-Stokes equations in a strip. We obtain a regularity result and a new a priori estimate of the solution. We establish the discontinuity of the solution when the boundary data of pressure have a jump discontinuity. We also derive a formula for the discontinuous part and show that the remainder is smooth in the strip. 相似文献
14.
We generalize the concept of a break by considering pairs of arbitrary rounds. We show that a set of home-away patterns minimizing the number of generalized breaks cannot be found in polynomial time, unless P=NP. When all teams have the same break set, the decision version becomes easy; optimizing remains NP-hard. 相似文献
15.
A d-angulation is a planar map with faces of degree d. We present for each integer d?3 a bijection between the class of d-angulations of girth d (i.e., with no cycle of length less than d) and a class of decorated plane trees. Each of the bijections is obtained by specializing a “master bijection” which extends an earlier construction of the first author. Our construction unifies known bijections by Fusy, Poulalhon and Schaeffer for triangulations (d=3) and by Schaeffer for quadrangulations (d=4). For d?5, both the bijections and the enumerative results are new.We also extend our bijections so as to enumerate p-gonal d-angulations (d-angulations with a simple boundary of length p) of girth d. We thereby recover bijectively the results of Brown for simple p-gonal triangulations and simple 2p-gonal quadrangulations and establish new results for d?5.A key ingredient in our proofs is a class of orientations characterizing d-angulations of girth d. Earlier results by Schnyder and by De Fraysseix and Ossona de Mendez showed that simple triangulations and simple quadrangulations are characterized by the existence of orientations having respectively indegree 3 and 2 at each inner vertex. We extend this characterization by showing that a d-angulation has girth d if and only if the graph obtained by duplicating each edge d−2 times admits an orientation having indegree d at each inner vertex. 相似文献
16.
И. И. Баврин 《Analysis Mathematica》1976,2(4):235-248
Extremal problems are treated for the classR
d, the latter being a two-dimensional generalization of the class of complex variable functions which are regular in a disc and close-to-convex. 相似文献
17.
Yves Nievergelt 《Numerische Mathematik》2002,91(2):257-303
Summary. The algorithm proved here solves the problem of orthogonal distance regression for the maximum norm with hyperplanes and
hyperspheres. For each finite set of points in a Euclidean space of any dimension, the algorithm determines – through finitely
many arithmetic operations – all the hyperplanes and hyperspheres that minimize the maximum Euclidean distance measured perpendicularly
from the data. The algorithm finds all the slabs (bounded by parallel hyperplanes) and all the spherical shells (bounded by
concentric hyperspheres) that contain all the data and are “rigidly supported” by the data (for which there does not exist any other pair of parallel hypersurfaces of the same type that intersect the data at the same points.) The computational
complexity of the algorithm increases as the number of data points raised to the dimension of the ambient space. The solutions
are then the midrange hyperplanes in the thinnest slabs, and the midrange hyperspheres in the thinnest shells. Their sensitivity
to perturbations of the data is of the order of a power of the reciprocal of the smallest angle between two median hyperplanes
separating two pairs of data points. The methods of proof consist in showing that if a pair of parallel hyperplanes or hyperspheres
is not rigidly supported but encompasses all the data, then there exists a projective shift of their common projective center
producing a thinner slab or shell that still contains all the data.
Received December 14, 1999 / Revised version received August 30, 2000 / Published online September 19, 2001 相似文献
18.
Adam Hosein 《Acta Analytica》2013,28(4):495-508
Rawls developed a contractualist theory of social justice and Scanlon attempted to extend the Rawlsian framework to develop a theory of rightness, or morality more generally. I argue that there are some good reasons to adopt a contractualist theory of social justice, but that it is a mistake to adopt a contractualist theory of rightness. I begin by illustrating the major shared features of Scanlon and Rawls’ theories. I then show that the justification for these features in Rawls’ theory, the centrality of cooperative fairness to social justice, cannot be used to defend their use in Scanlon’s. Finally, I argue that Scanlon has not provided an adequate alternative defense of these features, and show that they create problems when contractualists try to explain major features of our common-sense morality. 相似文献
19.
20.
A packing (resp. covering) ? of a normed space X consisting of unit balls is called completely saturated (resp. completely reduced) if no finite set of its members can be replaced by a more numerous (resp. less numerous) set of unit balls of X without losing the packing property (resp. covering property) of ?. We show that a normed space X admits completely saturated packings with disjoint closed unit balls as well as completely reduced coverings with open unit balls, provided that there exists a tiling of X with unit balls. Completely reduced coverings by open balls are of interest in the context of an approximation theory for continuous real‐valued functions that rests on so‐called controllable coverings of compact metric spaces. The close relation between controllable coverings and completely reduced coverings allows an extension of the approximation theory to non‐compact spaces. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献