共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
Let κ be a cardinal which is measurable after generically adding many Cohen subsets to κ and let be the κ-Rado graph. We prove, for 2 ≤ m < ω, that there is a finite value such that the set [κ]
m
can be partitioned into classes such that for any coloring of any of the classes C
i
in fewer than κ colors, there is a copy of in such that is monochromatic. It follows that , that is, for any coloring of with fewer than κ colors there is a copy of such that has at most colors. On the other hand, we show that there are colorings of such that if is any copy of then for all , and hence . We characterize as the cardinality of a certain finite set of types and obtain an upper and a lower bound on its value. In particular, and for m > 2 we have where r
m
is the corresponding number of types for the countable Rado graph.
Research of M. Džamonja and J. A. Larson were partially supported by Engineering and Physical Sciences Research Council and
research of W. J. Mitchell was partly supported by grant number DMS 0400954 from the United States National Science Foundation. 相似文献
3.
Emanuele Delucchi 《Journal of Algebraic Combinatorics》2007,26(4):477-494
Given a finite group G and a natural number n, we study the structure of the complex of nested sets of the associated Dowling lattice
(Proc. Internat. Sympos., 1971, pp. 101–115) and of its subposet of the G-symmetric partitions
which was recently introduced by Hultman (, 2006), together with the complex of G-symmetric phylogenetic trees
. Hultman shows that the complexes
and
are homotopy equivalent and Cohen–Macaulay, and determines the rank of their top homology.
An application of the theory of building sets and nested set complexes by Feichtner and Kozlov (Selecta Math. (N.S.)
10, 37–60, 2004) shows that in fact
is subdivided by the order complex of
. We introduce the complex of Dowling trees
and prove that it is subdivided by the order complex of
. Application of a theorem of Feichtner and Sturmfels (Port. Math. (N.S.)
62, 437–468, 2005) shows that, as a simplicial complex,
is in fact isomorphic to the Bergman complex of the associated Dowling geometry.
Topologically, we prove that
is obtained from
by successive coning over certain subcomplexes. It is well known that
is shellable, and of the same dimension as
. We explicitly and independently calculate how many homology spheres are added in passing from
to
. Comparison with work of Gottlieb and Wachs (Adv. Appl. Math.
24(4), 301–336, 2000) shows that
is intimely related to the representation theory of the top homology of
.
Research partially supported by the Swiss National Science Foundation, project PP002-106403/1. 相似文献
4.
The main result of this work is a Dancer-type bifurcation result for the quasilinear elliptic problem
Here, Ω is a bounded domain in denotes the Dirichlet p-Laplacian on , and is a spectral parameter. Let μ1 denote the first (smallest) eigenvalue of −Δ
p
. Under some natural hypotheses on the perturbation function , we show that the trivial solution is a bifurcation point for problem (P) and, moreover, there are two distinct continua, and , consisting of nontrivial solutions to problem (P) which bifurcate from the set of trivial solutions at the bifurcation point (0, μ1). The continua and are either both unbounded in E, or else their intersection contains also a point other than (0, μ1). For the semilinear problem (P) (i.e., for p = 2) this is a classical result due to E. N. Dancer from 1974. We also provide an example of how the union looks like (for p > 2) in an interesting particular case.
Our proofs are based on very precise, local asymptotic analysis for λ near μ1 (for any 1 < p < ∞) which is combined with standard topological degree arguments from global bifurcation theory used in Dancer’s original
work.
Submitted: July 28, 2007. Accepted: November 8, 2007. 相似文献
((P)) |
5.
Joshua A. Cole 《Archive for Mathematical Logic》2008,46(7-8):649-664
Let be the lattice of degrees of non-empty subsets of 2
ω
under Medvedev reducibility. Binns and Simpson proved that FD(ω), the free distributive lattice on countably many generators, is lattice-embeddable below any non-zero element in . Cenzer and Hinman proved that is dense, by adapting the Sacks Preservation and Sacks Coding Strategies used in the proof of the density of the c.e. Turing
degrees. With a construction that is a modification of the one by Cenzer and Hinman, we improve on the result of Binns and
Simpson by showing that for any , we can lattice embed FD(ω) into strictly between and . We also note that, in contrast to the infinite injury in the proof of the Sacks Density Theorem, in our proof all injury
is finite, and that this is also true for the proof of Cenzer and Hinman, if a straightforward simplification is made.
Thanks to my adviser Peter Cholak for his guidance in my research. I also wish to thank the anonymous referee for helpful
comments and suggestions. My research was partially supported by NSF grants DMS-0245167 and RTG-0353748 and a Schmitt Fellowship
at the University of Notre Dame. 相似文献
6.
S. De Winter 《Journal of Algebraic Combinatorics》2006,24(3):285-297
Let be a proper partial geometry pg(s,t,2), and let G be an abelian group of automorphisms of acting regularly on the points of . Then either t≡2±od
s+1 or is a pg(5,5,2) isomorphic to the partial geometry of van Lint and Schrijver (Combinatorica 1 (1981), 63–73). This result is a new step towards the classification of partial geometries with an abelian Singer group and further provides an interesting characterization of the geometry of van Lint and Schrijver.The author is Postdoctoral Fellow of the Fund for Scientific Research Flanders (FWO-Vlaanderen). 相似文献
7.
Amílcar Pacheco 《Mathematische Zeitschrift》2009,261(4):787-804
Let k be a field of characteristic q, a smooth geometrically connected curve defined over k with function field . Let A/K be a non-constant abelian variety defined over K of dimension d. We assume that q = 0 or > 2d + 1. Let p ≠ q be a prime number and a finite geometrically Galois and étale cover defined over k with function field . Let (τ′, B′) be the K′/k-trace of A/K. We give an upper bound for the -corank of the Selmer group Sel
p
(A ×
K
K′), defined in terms of the p-descent map. As a consequence, we get an upper bound for the -rank of the Lang–Néron group A(K′)/τ′B′(k). In the case of a geometric tower of curves whose Galois group is isomorphic to , we give sufficient conditions for the Lang–Néron group of A to be uniformly bounded along the tower.
This work was partially supported by CNPq research grant 305731/2006-8. 相似文献
8.
A. M. Nurakunov 《Algebra Universalis》2007,57(2):207-214
Let A be a finite algebra and a quasivariety. By
A is meant the lattice of congruences θ on A with . For any positive integer n, we give conditions on a finite algebra A under which for any n-element lattice L there is a quasivariety such that .
The author was supported by INTAS grant 03-51-4110. 相似文献
9.
Concettina Galati 《Annali di Matematica Pura ed Applicata》2009,188(2):359-368
Let be the variety of irreducible sextics with six cusps as singularities. Let be one of irreducible components of . Denoting by the space of moduli of smooth curves of genus 4, we consider the rational map sending the general point [Γ] of Σ, corresponding to a plane curve , to the point of parametrizing the normalization curve of Γ. The number of moduli of Σ is, by definition the dimension of Π(Σ). We know that
, where ρ(2, 4, 6) is the Brill–Noether number of linear series of dimension 2 and degree 6 on a curve of genus 4. We prove that both
irreducible components of have number of moduli equal to seven.
相似文献
10.
We discuss the analytic properties of curves γ whose global curvature function ρ
G
[γ]−1 is p-integrable. It turns out that the L
p
-norm is an appropriate model for a self-avoidance energy interpolating between “soft” knot energies in form of singular repulsive
potentials and “hard” self-obstacles, such as a lower bound on the global radius of curvature introduced by Gonzalez and Maddocks.
We show in particular that for all p > 1 finite -energy is necessary and sufficient for W
2,p
-regularity and embeddedness of the curve. Moreover, compactness and lower-semicontinuity theorems lead to the existence of
-minimizing curves in given isotopy classes. There are obvious extensions to other variational problems for curves and nonlinearly
elastic rods, where one can introduce a bound on to preclude self-intersections. 相似文献
11.
Jean-Philippe Furter 《Mathematische Annalen》2009,343(4):901-920
Let be the group of polynomial automorphisms of the complex affine plane. On one hand, can be endowed with the structure of an infinite dimensional algebraic group (see Shafarevich in Math USSR Izv 18:214–226,
1982) and on the other hand there is a partition of according to the multidegree (see Friedland and Milnor in Ergod Th Dyn Syst 9:67–99, 1989). Let denote the set of automorphisms whose multidegree is equal to d. We prove that is a smooth, locally closed subset of and show some related results. We give some applications to the study of the varieties (resp. ) of automorphisms whose degree is equal to m (resp. is less than or equal to m). 相似文献
12.
Isabelle Vidal 《manuscripta mathematica》2009,130(1):21-44
Let be a smooth proper surface over a finite field of characteristic p > 2, and let be a rank one smooth l-adic sheaf (l ≠ p) on a dense open subset . In this paper, under some assumptions on the wild ramification of , we prove a torsion formula for the epsilon factor (that is the global constant) of the functional equation of the L-function . Our torsion formula is a generalization to higher dimension of the classical torsion formula for the local constants.
Résumé Soit une surface propre et lisse sur un corps fini de caractéristique p > 2, et un caractère l-adique (avec l ≠ p) lisse sur un ouvert dense . Sous certaines hypothèses sur la ramification sauvage de , on prouve une formule de torsion pour le facteur epsilon (i.e. la constante globale) de l’équation fonctionnelle de la fonction . Notre formule de torsion est une généralisation en dimension supérieure de la formule de torsion pour les constantes locales, qui est à la base de la théorie des constantes locales.相似文献
13.
Thomas Westerbäck 《Designs, Codes and Cryptography》2007,42(3):335-355
A maximal partial Hamming packing of is a family of mutually disjoint translates of Hamming codes of length n, such that any translate of any Hamming code of length n intersects at least one of the translates of Hamming codes in . The number of translates of Hamming codes in is the packing number, and a partial Hamming packing is strictly partial if the family does not constitute a partition of .
A simple and useful condition describing when two translates of Hamming codes are disjoint or not disjoint is proved. This
condition depends on the dual codes of the corresponding Hamming codes. Partly, by using this condition, it is shown that
the packing number p, for any maximal strictly partial Hamming packing of , n = 2
m
−1, satisfies .
It is also proved that for any n equal to 2
m
−1, , there exist maximal strictly partial Hamming packings of with packing numbers n−10,n−9,n−8,...,n−1. This implies that the upper bound is tight for any n = 2
m
−1, .
All packing numbers for maximal strictly partial Hamming packings of , n = 7 and 15, are found by a computer search. In the case n = 7 the packing number is 5, and in the case n = 15 the possible packing numbers are 5,6,7,...,13 and 14.
相似文献
14.
M. Przybylska 《Regular and Chaotic Dynamics》2009,14(2):263-311
We consider natural complex Hamiltonian systems with n degrees of freedom given by a Hamiltonian function which is a sum of the standard kinetic energy and a homogeneous polynomial
potential V of degree k > 2. The well known Morales-Ramis theorem gives the strongest known necessary conditions for the Liouville integrability
of such systems. It states that for each k there exists an explicitly known infinite set ⊂ ℚ such that if the system is integrable, then all eigenvalues of the Hessian matrix V″(d) calculated at a non-zero d ∈ ℂ
n
satisfying V′(d) = d, belong to .
The aim of this paper is, among others, to sharpen this result. Under certain genericity assumption concerning V we prove the following fact. For each k and n there exists a finite set such that if the system is integrable, then all eigenvalues of the Hessian matrix V″(d) belong to . We give an algorithm which allows to find sets .
We applied this results for the case n = k = 3 and we found all integrable potentials satisfying the genericity assumption. Among them several are new and they are
integrable in a highly non-trivial way. We found three potentials for which the additional first integrals are of degree 4
and 6 with respect to the momenta.
相似文献
15.
Let Φ be an irreducible crystallographic root system with Weyl group W and coroot lattice
, spanning a Euclidean space V. Let m be a positive integer and
be the arrangement of hyperplanes in V of the form
for
and
. It is known that the number
of bounded dominant regions of
is equal to the number of facets of the positive part
of the generalized cluster complex associated to the pair
by S. Fomin and N. Reading.
We define a statistic on the set of bounded dominant regions of
and conjecture that the corresponding refinement of
coincides with the $h$-vector of
. We compute these refined numbers for the classical root systems as well as for all root systems when m = 1 and verify the conjecture when Φ has type A, B or C and when m = 1. We give several combinatorial interpretations to these numbers in terms of chains of order ideals in the root poset of Φ,
orbits of the action of W on the quotient
and coroot lattice points inside a certain simplex, analogous to the ones given by the first author in the case of the set
of all dominant regions of
. We also provide a dual interpretation in terms of order filters in the root poset of Φ in the special case m = 1.
2000 Mathematics Subject Classification Primary—20F55; Secondary—05E99, 20H15 相似文献
16.
Let and be C*-dynamical systems and assume that is a separable simple C*-algebra and that α and β are *-automorphisms. Then the semicrossed products and are isometrically isomorphic if and only if the dynamical systems and are outer conjugate.
K. R. Davidson was partially supported by an NSERC grant. E. G. Katsoulis was partially supported by a summer grant from ECU 相似文献
17.
We consider the computation of stable approximations to the exact solution of nonlinear ill-posed inverse problems F(x) = y with nonlinear operators F : X → Y between two Hilbert spaces X and Y by the Newton type methods
in the case that only available data is a noise of y satisfying with a given small noise level . We terminate the iteration by the discrepancy principle in which the stopping index is determined as the first integer such that
with a given number τ > 1. Under certain conditions on {α
k
}, {g
α
} and F, we prove that converges to as and establish various order optimal convergence rate results. It is remarkable that we even can show the order optimality
under merely the Lipschitz condition on the Fréchet derivative F′ of F if is smooth enough. 相似文献
18.
Javier Pérez Alvarez 《Mathematische Zeitschrift》2009,262(1):17-26
We shall call quantum states of a principal bundle π : P → M with structure group a semi-simple Lie group G, the elements of certain space of sections of the adjoint bundle , associated to the G-bundle of connections . An inner product of sections of is defined for which is a Hilbert space such that the Gauge group gau(P) of the given bundle represents in a family of self-adjoint operators. This work crystallizes some heuristic considerations,
on the unitary representations of Gauge algebras, of Garcia in the already a classical article (J. Differ. Geom. 12, 209–227, 1977). 相似文献
19.
Valentina S. Harizanov Carl G. JockuschJr. Julia F. Knight 《Archive for Mathematical Logic》2009,48(1):39-53
We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable
partial ordering which has an infinite chain but none that is or , and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering
which has an infinite chain must have an infinite chain that is the difference of two sets. Our main result is that there is a computably axiomatizable theory K of partial orderings such that K has a computable model with arbitrarily long finite chains but no computable model with an infinite chain. We also prove
the corresponding result for antichains. Finally, we prove that if a computable partial ordering has the feature that for every , there is an infinite chain or antichain that is relative to , then we have uniform dichotomy: either for all copies of , there is an infinite chain that is relative to , or for all copies of , there is an infinite antichain that is relative to . 相似文献