共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
Claudia Bucur Luca Lombardini Enrico Valdinoci 《Annales de l'Institut Henri Poincaré (C) Analyse Non Linéaire》2019,36(3):655-703
In this paper, we consider the asymptotic behavior of the fractional mean curvature when . Moreover, we deal with the behavior of s-minimal surfaces when the fractional parameter is small, in a bounded and connected open set with boundary . We classify the behavior of s-minimal surfaces with respect to the fixed exterior data (i.e. the s-minimal set fixed outside of Ω). So, for s small and depending on the data at infinity, the s-minimal set can be either empty in Ω, fill all Ω, or possibly develop a wildly oscillating boundary.Also, we prove the continuity of the fractional mean curvature in all variables, for . Using this, we see that as the parameter s varies, the fractional mean curvature may change sign. 相似文献
3.
Bhargav Bhatt 《Journal of Pure and Applied Algebra》2019,223(5):1940-1945
Given a commutative ring A and a finitely generated ideal I, we prove that -torsion A-modules that are also I-adically complete (or merely derived I-complete) must have bounded -torsion, i.e., they are killed by for some . 相似文献
4.
5.
6.
7.
Let be the finite field of characteristic p with q elements and its extension of degree n. We prove that there exists a primitive element of that produces a completely normal basis of over , provided that with and . 相似文献
8.
《Discrete Mathematics》2022,345(1):112659
In a recent paper, Gerbner, Patkós, Tuza and Vizer studied regular F-saturated graphs. One of the essential questions is given F, for which n does a regular n-vertex F-saturated graph exist. They proved that for all sufficiently large n, there is a regular -saturated graph with n vertices. We extend this result to both and and prove some partial results for larger complete graphs. Using a variation of sum-free sets from additive combinatorics, we prove that for all , there is a regular -saturated with n vertices for infinitely many n. Studying the sum-free sets that give rise to -saturated graphs is an interesting problem on its own and we state an open problem in this direction. 相似文献
9.
For an ideal generated by all square-free monomials of degree m in a polynomial ring R with n variables, we obtain a specific embedding of a canonical module of to itself. The construction of this explicit embedding depends on a minimal free R-resolution of an ideal generated by . Using this embedding, we give a resolution of connected sums of several copies of certain Artin -algebras where is a field. 相似文献
10.
We study standing waves of NLS equation posed on the double-bridge graph: two semi-infinite half-lines attached at a circle. At the two vertices Kirchhoff boundary conditions are imposed. The configuration of the graph is characterized by two lengths, and . We study the solutions with possibly nontrivial components on the half-lines and a cnoidal component on the circle. The problem is equivalent to a nonlinear boundary value problem in which the boundary condition depends on the spectral parameter ω. After classifying the solutions with rational , we turn to irrational showing that there exist standing waves only in correspondence to a countable set of negative frequencies . Moreover we show that the frequency sequence admits cluster points and any negative real number can be a limit point of frequencies choosing a suitable irrational geometry . These results depend on basic properties of diophantine approximation of real numbers. 相似文献
11.
12.
Let be a rotation on the circle and let φ be a step function. Denote by the ergodic sums . For α in a class containing the rotations with bounded partial quotients and under a Diophantine condition on the discontinuities of φ, we show that is asymptotically Gaussian for n in a set of density 1. 相似文献
13.
Let be the number of monochromatic copies of a fixed connected graph in a uniformly random coloring of the vertices of the graph . In this paper we give a complete characterization of the limiting distribution of , when is a converging sequence of dense graphs. When the number of colors grows to infinity, depending on whether the expected value remains bounded, either converges to a finite linear combination of independent Poisson variables or a normal distribution. On the other hand, when the number of colors is fixed, converges to a (possibly infinite) linear combination of independent centered chi-squared random variables. This generalizes the classical birthday problem, which involves understanding the asymptotics of , the number of monochromatic -cliques in a complete graph (-matching birthdays among a group of friends), to general monochromatic subgraphs in a network. 相似文献
14.
We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs as follows. For a graph and a subset of we let be the number of vertices incident with an edge in and an edge in . For a subset of , let be the rank of the adjacency matrix between and over the binary field. We prove that a class of graphs has bounded tree-depth if and only if the corresponding class of functions has bounded branch-depth and similarly a class of graphs has bounded shrub-depth if and only if the corresponding class of functions has bounded branch-depth, which we call the rank-depth of graphs.Furthermore we investigate various potential generalizations of tree-depth to matroids and prove that matroids representable over a fixed finite field having no large circuits are well-quasi-ordered by restriction. 相似文献
15.
We consider a generalisation of a conjecture by Patterson and Wiedemann from 1983 on the Hamming distance of a function from to to the set of affine functions from to . We prove the conjecture for each q such that the characteristic of lies in a subset of the primes with density 1 and we prove the conjecture for all q by assuming the generalised Riemann hypothesis. Roughly speaking, we show the existence of functions for which the distance to the affine functions is maximised when n tends to infinity. This also determines the asymptotic behaviour of the covering radius of the Reed-Muller code over and so answers a question raised by Leducq in 2013. Our results extend the case , which was recently proved by the author and which corresponds to the original conjecture by Patterson and Wiedemann. Our proof combines evaluations of Gauss sums in the semiprimitive case, probabilistic arguments, and methods from discrepancy theory. 相似文献
16.
Jacques Darné 《Journal of Pure and Applied Algebra》2019,223(12):5484-5525
17.
《Discrete Mathematics》2022,345(11):113059
Let be the finite field of q elements and let be the dihedral group of 2n elements. Left ideals of the group algebra are known as left dihedral codes over of length 2n, and abbreviated as left -codes. Let . In this paper, we give an explicit representation for the Euclidean hull of every left -code over . On this basis, we determine all distinct Euclidean LCD codes and Euclidean self-orthogonal codes which are left -codes over . In particular, we provide an explicit representation and a precise enumeration for these two subclasses of left -codes and self-dual left -codes, respectively. Moreover, we give a direct and simple method for determining the encoder (generator matrix) of any left -code over , and present several numerical examples to illustrative our applications. 相似文献
18.
Huffman (2013) [12] studied -linear codes over and he proved the MacWilliams identity for these codes with respect to ordinary and Hermitian trace inner products. Let S be a finite commutative -algebra. An -linear code over S of length n is an -submodule of . In this paper, we study -linear codes over S. We obtain some bounds on minimum distance of these codes, and some large classes of MDR codes are introduced. We generalize the ordinary and Hermitian trace products over -algebras and we prove the MacWilliams identity with respect to the generalized form. In particular, we obtain Huffman's results on the MacWilliams identity. Among other results, we give a theory to construct a class of quantum codes and the structure of -linear codes over finite commutative graded -algebras. 相似文献
20.
n-to-1 mappings have wide applications in many areas, especially in cryptography, finite geometry, coding theory and combinatorial design. In this paper, many classes of n-to-1 mappings over finite fields are studied. First, we provide a characterization of general n-to-1 mappings over by means of the Walsh transform. Then, we completely determine 3-to-1 polynomials with degree no more than 4 over . Furthermore, we obtain an AGW-like criterion for characterizing some close relationship between the n-to-1 property of a mapping over finite set A and that of another mapping over a subset of A. Finally, we apply the AGW-like criterion into several forms of polynomials and obtain some explicit n-to-1 mappings. Especially, three explicit constructions of the form from the cyclotomic perspective, and several classes of n-to-1 mappings of the form are provided. 相似文献