共查询到20条相似文献,搜索用时 203 毫秒
1.
Sanming Zhou 《Journal of Pure and Applied Algebra》2019,223(3):931-947
We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of , with connection sets and , respectively, where () is an mth primitive root of unity, A a nonzero ideal of , and ? Euler's totient function. We call them the mth cyclotomic graph and the second kind mth cyclotomic graph, and denote them by and , respectively. We give a necessary and sufficient condition for to be a perfect t-code in and a necessary condition for to be such a code in , where is an integer and D an ideal of containing A. In the case when , is known as an Eisenstein–Jacobi and Gaussian networks, respectively, and we obtain necessary conditions for to be a perfect t-code in , where with β dividing α. In the literature such conditions are known to be sufficient when and under an additional condition. We give a classification of all first kind Frobenius circulants of valency 2p and prove that they are all pth cyclotomic graphs, where p is an odd prime. Such graphs belong to a large family of Cayley graphs that are efficient for routing and gossiping. 相似文献
2.
We deal here with planar analytic systems which are small perturbations of a period annulus. For each transversal section Σ to the unperturbed orbits we denote by the time needed by a perturbed orbit that starts from to return to Σ. We call this the flight return time function. We say that the closed orbit Γ of is a continuable critical orbit in a family of the form if, for any and any Σ that passes through q, there exists a critical point of such that as . In this work we study this new problem of continuability.In particular we prove that a simple critical periodic orbit of is a continuable critical orbit in any family of the form . We also give sufficient conditions for the existence of a continuable critical orbit of an isochronous center . 相似文献
3.
We study G-vertex-primitive and -arc-transitive digraphs for almost simple groups G with socle . We prove that for such digraphs, which provides the first step in determining an upper bound on s for all the vertex-primitive s-arc-transitive digraphs. 相似文献
4.
5.
Michael Giudici S.P. Glasby Cai Heng Li Gabriel Verret 《Journal of Pure and Applied Algebra》2019,223(3):1217-1226
Let Γ be a finite G-vertex-transitive digraph. The in-local action of is the permutation group induced by a vertex-stabiliser on the set of in-neighbours of the corresponding vertex. The out-local action is defined analogously. Note that and may not be isomorphic. We thus consider the problem of determining which pairs are possible. We prove some general results, but pay special attention to the case when and are both quasiprimitive. (Recall that a permutation group is quasiprimitive if each of its nontrivial normal subgroups is transitive.) Along the way, we prove a structural result about pairs of finite quasiprimitive groups of the same degree, one being (abstractly) isomorphic to a proper quotient of the other. 相似文献
6.
Trying to interpret B. Zilber's project on model theory of quantum mechanics we study a way of building limit models from finite-dimensional approximations. Our point of view is that of metric model theory, and we develop a method of taking ultraproducts of unbounded operators. We first calculate the Feynman propagator for the free particle as defined by physicists as an inner product of the eigenvector of the position operator with eigenvalue and , where is the time evolution operator. However, due to a discretising effect, the eigenvector method does not work as expected, and straightforward calculations give the wrong value. We look at this phenomenon, and then complement this by showing how to instead correctly calculate the kernel of the time evolution operator (for both the free particle and the harmonic oscillator) in the limit model. We believe that our method of calculating these is new. 相似文献
7.
《Discrete Mathematics》2022,345(7):112866
Let G be a graph with n vertices. A path decomposition of G is a set of edge-disjoint paths containing all the edges of G. Let denote the minimum number of paths needed in a path decomposition of G. Gallai Conjecture asserts that if G is connected, then . If G is allowed to be disconnected, then the upper bound for was obtained by Donald [7], which was improved to independently by Dean and Kouider [6] and Yan [14]. For graphs consisting of vertex-disjoint triangles, is reached and so this bound is tight. If triangles are forbidden in G, then can be derived from the result of Harding and McGuinness [11], where g denotes the girth of G. In this paper, we also focus on triangle-free graphs and prove that , which improves the above result with . 相似文献
8.
Martin Strömqvist 《Journal of Differential Equations》2019,266(12):7948-7979
We state and prove estimates for the local boundedness of subsolutions of non-local, possibly degenerate, parabolic integro-differential equations of the form , where P.V. means in the principle value sense, and the kernel obeys for some , uniformly in . 相似文献
9.
Shai Shechter 《Journal of Pure and Applied Algebra》2019,223(10):4384-4425
Let be a complete discrete valuation ring with finite residue field of odd characteristic, and let G be a symplectic or special orthogonal group scheme over . For any let denote the ?-th principal congruence subgroup of . An irreducible character of the group is said to be regular if it is trivial on a subgroup for some ?, and if its restriction to consists of characters of minimal -stabilizer dimension. In the present paper we consider the regular characters of such classical groups over , and construct and enumerate all regular characters of , when the characteristic of is greater than two. As a result, we compute the regular part of their representation zeta function. 相似文献
10.
Charles Almeida Aline V. Andrade Rosa M. Miró-Roig 《Journal of Pure and Applied Algebra》2019,223(4):1817-1831
Let be a minimal monomial Togliatti system of forms of degree d. In [4], Mezzetti and Miró-Roig proved that the minimal number of generators of lies in the interval . In this paper, we prove that for and , the integer values in cannot be realized as the number of minimal generators of a minimal monomial Togliatti system. We classify minimal monomial Togliatti systems of forms of degree d with or 3n (i.e. with the minimal number of generators reaching the border of the non-existence interval). Finally, we prove that for , and there exists a minimal monomial Togliatti system of forms of degree d with . 相似文献
11.
Let p be an odd prime number. We describe the Whitehead group of all extra-special and almost extra-special p-groups. For this we compute, for any finite p-group P, the subgroup of , in terms of a genetic basis of P. We also introduce a deflation map , for a normal subgroup N of P, and show that it is always surjective. Along the way, we give a new proof of the result describing the structure of , when P is an elementary abelian p-group. 相似文献
12.
13.
14.
Ruxi Shi 《Journal of Functional Analysis》2019,276(12):3767-3794
15.
Mi Hee Park 《Journal of Pure and Applied Algebra》2019,223(9):3980-3988
There are many Noetherian-like rings. Among them, we are interested in SFT-rings, piecewise Noetherian rings, and rings with Noetherian prime spectrum. Some of them are stable under polynomial extensions but none of them are stable under power series extensions. We give partial answers to some open questions related with stabilities of such rings. In particular, we show that any mixed extensions over a zero-dimensional SFT ring R are also SFT-rings, and that if R is an SFT-domain such that is integrally closed for each prime ideal P of R, then is an SFT-ring. We also give a direct proof that if R is an SFT Prüfer domain, then is an SFT-ring. Finally, we show that the power series extension over a Prüfer domain R is piecewise Noetherian if and only if R is Noetherian. 相似文献
16.
17.
《Discrete Mathematics》2022,345(1):112640
We show that the lattice point enumerator satisfies for any bounded sets with integer points and all .We also prove that a certain family of compact sets, extending that of cubes , with , minimizes the functional , for any , among those bounded sets with given positive lattice point enumerator.Finally, we show that these new discrete inequalities imply the corresponding classical Brunn-Minkowski and isoperimetric inequalities for non-empty compact sets. 相似文献
18.
《Discrete Mathematics》2021,344(12):112600
An -colored-mixed graph is a graph having m colors of arcs and n colors of edges. We do not allow two arcs or edges to have the same endpoints. A homomorphism from an -colored-mixed graph G to another -colored-mixed graph H is a morphism such that each edge (resp. arc) of G is mapped to an edge (resp. arc) of H of the same color (and orientation). An -colored-mixed graph T is said to be -universal if every graph in (the planar -colored-mixed graphs with girth at least g) admits a homomorphism to T.We show that planar -universal graphs do not exist for (and any value of g) and find a minimal (in the number vertices) planar -universal graphs in the other cases. 相似文献
19.
《Discrete Mathematics》2022,345(7):112893
In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let Γ and be finite simple graphs with at least three vertices such that there exists a bijective map and for any , there exists an isomorphism . Then we define the associated directed graph with two kinds of arrows from the graphs Γ and , the bijective map f and the isomorphisms . By investigating the associated directed graph , we study when are the two graphs Γ and isomorphic. 相似文献
20.