共查询到20条相似文献,搜索用时 15 毫秒
1.
In this paper, we study the existence of the n-flat preenvelope and the n-FP-injective cover. We also characterize n-coherent rings in terms of the n-FP-injective and n-flat modules. 相似文献
2.
Gustavo Jasso 《Mathematische Zeitschrift》2016,283(3-4):703-759
We introduce n-abelian and n-exact categories, these are analogs of abelian and exact categories from the point of view of higher homological algebra. We show that n-cluster-tilting subcategories of abelian (resp. exact) categories are n-abelian (resp. n-exact). These results allow to construct several examples of n-abelian and n-exact categories. Conversely, we prove that n-abelian categories satisfying certain mild assumptions can be realized as n-cluster-tilting subcategories of abelian categories. In analogy with a classical result of Happel, we show that the stable category of a Frobenius n-exact category has a natural \((n+2)\)-angulated structure in the sense of Geiß–Keller–Oppermann. We give several examples of n-abelian and n-exact categories which have appeared in representation theory, commutative algebra, commutative and non-commutative algebraic geometry. 相似文献
3.
In this paper, we give the eigenvalues of the manifold Sp(n)/U(n). We prove that an eigenvalue λ
s
(f
2, f
2, …, f
n
) of the Lie group Sp(n), corresponding to the representation with label (f
1, f
2, ..., f
n
), is an eigenvalue of the manifold Sp(n)/U(n), if and only if f
1, f
2, …, f
n
are all even. 相似文献
4.
V. N. Potapov 《Siberian Mathematical Journal》2011,52(2):303-310
A clique matching in the k-ary n-dimensional cube (hypercube) is a collection of disjoint one-dimensional faces. A clique matching is called perfect if it covers all vertices of the hypercube. We show that the number of perfect clique matchings in the k-ary n-dimensional cube can be expressed as the k-dimensional permanent of the adjacency array of some hypergraph. We calculate the order of the logarithm of the number of
perfect clique matchings in the k-ary n-dimensional cube for an arbitrary positive integer k as n→∞. 相似文献
5.
A. S. Fil’chenkov 《Russian Mathematics (Iz VUZ)》2016,60(6):79-87
We construct an example of the skew product on n-dimensional cell with transitive but not totally transitive n-dimensional attractor. 相似文献
6.
Alexander V. Isaev 《Geometric And Functional Analysis》2007,17(1):192-219
We obtain a complete classification of complex Kobayashihyperbolic manifolds of dimension n ≥ 2, for which the dimension of the group of holomorphic automorphisms is equal to n2.
Received: May 2005 Accepted: November 2005 相似文献
7.
Dong-il Lee 《Algebras and Representation Theory》2010,13(6):705-718
In this note, we find a monomial basis of the cyclotomic Hecke algebra \({\mathcal{H}_{r,p,n}}\) of G(r,p,n) and show that the Ariki-Koike algebra \({\mathcal{H}_{r,n}}\) is a free module over \({\mathcal{H}_{r,p,n}}\), using the Gröbner-Shirshov basis theory. For each irreducible representation of \({\mathcal{H}_{r,p,n}}\), we give a polynomial basis consisting of linear combinations of the monomials corresponding to cozy tableaux of a given shape. 相似文献
8.
We characterise (residually-finite) groups which possess less than n subgroups of index n for almost all n ∈ ℕ. 相似文献
9.
In this paper we consider n-poised planar node sets, as well as more special ones, called G C n sets. For the latter sets each n-fundamental polynomial is a product of n linear factors as it always holds in the univariate case. A line ? is called k-node line for a node set \(\mathcal X\) if it passes through exactly k nodes. An (n + 1)-node line is called maximal line. In 1982 M. Gasca and J. I. Maeztu conjectured that every G C n set possesses necessarily a maximal line. Till now the conjecture is confirmed to be true for n ≤ 5. It is well-known that any maximal line M of \(\mathcal X\) is used by each node in \(\mathcal X\setminus M, \)meaning that it is a factor of the fundamental polynomial. In this paper we prove, in particular, that if the Gasca-Maeztu conjecture is true then any n-node line of G C n set \(\mathcal {X}\) is used either by exactly \(\binom {n}{2}\) nodes or by exactly \(\binom {n-1}{2}\) nodes. We prove also similar statements concerning n-node or (n ? 1)-node lines in more general n-poised sets. This is a new phenomenon in n-poised and G C n sets. At the end we present a conjecture concerning any k-node line. 相似文献
10.
Benjamin Bond 《Graphs and Combinatorics》2016,32(2):495-510
Let \(\mathcal {A}\subset \left( {\begin{array}{c}[n]\\ r\end{array}}\right) \) be a compressed, intersecting family and let \(X\subset [n]\). Let \(\mathcal {A}(X)=\{A\in \mathcal {A}:A\cap X\ne \emptyset \}\) and \(\mathcal {S}_{n,r}=\left( {\begin{array}{c}[n]\\ r\end{array}}\right) (\{1\})\). Motivated by the Erd?s–Ko–Rado theorem, Borg asked for which \(X\subset [2,n]\) do we have \(|\mathcal {A}(X)|\le |\mathcal {S}_{n,r}(X)|\) for all compressed, intersecting families \(\mathcal {A}\)? We call X that satisfy this property EKR. Borg classified EKR sets X such that \(|X|\ge r\). Barber classified X, with \(|X|\le r\), such that X is EKR for sufficiently large n, and asked how large n must be. We prove n is sufficiently large when n grows quadratically in r. In the case where \(\mathcal {A}\) has a maximal element, we sharpen this bound to \(n>\varphi ^{2}r\) implies \(|\mathcal {A}(X)|\le |\mathcal {S}_{n,r}(X)|\). We conclude by giving a generating function that speeds up computation of \(|\mathcal {A}(X)|\) in comparison with the naïve methods. 相似文献
11.
Paola De Vito 《Ricerche di matematica》2011,60(1):39-43
We prove that if q = p
h
, p a prime, do not exist sets U í AG(n,q){U {\subseteq} AG(n,q)}, with |U| = q
k
and 1 < k < n, determining N directions where
\fracqk - 1p - 1 < N £ \fracq+32 q k-1+ qk-2 +...+q2 + q \frac{{q^k} - 1}{p - 1} < N \le \frac{q+3}{2} q ^{k-1}+ q^{k-2} +\dots+q{^2} + q 相似文献
12.
Let p be a prime, \(\varepsilon >0\) and \(0<L+1<L+N < p\). We prove that if \(p^{1/2+\varepsilon }< N <p^{1-\varepsilon }\), then 相似文献
$$\begin{aligned} \#\{n!\,\,({\mathrm{mod}} \,p);\,\, L+1\le n\le L+N\} > c (N\log N)^{1/2},\,\, c=c(\varepsilon )>0. \end{aligned}$$ 13.
We generalize Green’s lemma and Green’s theorem for usual binary semigroups to (n,m)-semigroups, define and describe the regularity for an element of an (n,m)-semigroup, give some criteria for an element of an (n,m)-semigroup to be invertible, and further apply the invertibility for (n,m)-semigroups to (n,m)-groups and give some equivalent characterizations for (n,m)-groups. We establish Hosszú-Gluskin theorems for (n,m)-semigroups in two cases, as generalizations of the corresponding theorems for n-groups. 相似文献
14.
Erdös et al and Gerencsér et al had shown that in any 2-edge-coloring of K 3n-1, there is a n-matching containing edges with the same color(we call such matching monochromatic matching). In this paper we show that for any 2-edge-coloring of K 3n-1 there exists a monochromatic subgraph H of K 3n-1 which contains exponentially many monochromatic n-matchings. 相似文献
15.
The C*-simplicity of n-periodic products is proved for a large class of groups. In particular, the n-periodic products of any finite or cyclic groups (including the free Burnside groups) are C*-simple. Continuum-many nonisomorphic 3-generated nonsimple C*-simple groups are constructed in each of which the identity xn = 1 holds, where n ≥ 1003 is any odd number. The problem of the existence of C*-simple groups without free subgroups of rank 2 was posed by de la Harpe in 2007. 相似文献
16.
We give a positive answer to the Aleksandrov problem in n-normed spaces under the surjectivity assumption. Namely, we show that every surjective mapping preserving n-distance one is affine, and thus is an n-isometry. This is the first time the Aleksandrov problem is solved in n-normed spaces with only the surjectivity assumption even in the usual case \(n=2\). Finally, when the target space is n-strictly convex, we prove that every mapping preserving two n-distances with an integer ratio is an affine n-isometry. 相似文献
17.
The paper gives some characterization theorems for the compact composition operator on some function spaces over the unit
ball B
n
in ℂ
n
. Especially, it gives a characterization for compact composition operators on BMOA(B
n
), which generalizes a result proved by Bourdon, Cima and Matheson for the case n = 1. 相似文献
18.
In (k, n) visual cryptographic schemes (VCS), a secret image is encrypted into n pages of cipher text, each printed on a transparency sheet, which are distributed among n participants. The image can be visually decoded if any k(≥2) of these sheets are stacked on top of one another, while this is not possible by stacking any k − 1 or fewer sheets. We employ a Kronecker algebra to obtain necessary and sufficient conditions for the existence of a (k, n) VCS with a prior specification of relative contrasts that quantify the clarity of the recovered image. The connection of
these conditions with an L
1-norm formulation as well as a convenient linear programming formulation is explored. These are employed to settle certain
conjectures on contrast optimal VCS for the cases k = 4 and 5. Furthermore, for k = 3, we show how block designs can be used to construct VCS which achieve optimality with respect to the average and minimum
relative contrasts but require much smaller pixel expansions than the existing ones. 相似文献
19.
Alexander Lemmens 《Journal of Algebraic Combinatorics》2018,47(4):561-584
We prove an explicit formula for the first nonzero entry in the n-th row of the graded Betti table of an n-dimensional projective toric variety associated with a normal polytope with at least one interior lattice point. This applies to Veronese embeddings of \(\mathbb {P}^n\). We also prove an explicit formula for the entire n-th row when the interior of the polytope is one-dimensional. All results are valid over an arbitrary field k. 相似文献
20.
W.-D. Richter 《Lithuanian Mathematical Journal》2009,49(1):93-108
For p > 0, the l
n,p
-generalized surface measure on the l
n,p
-unit sphere is studied and used for deriving a geometric measure representation for l
n,p
-symmetric distributions having a density. 相似文献
|