共查询到20条相似文献,搜索用时 31 毫秒
1.
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. 相似文献
2.
3.
4.
5.
《Indagationes Mathematicae》2022,33(2):494-516
Current work defines Schmidt representation of a bilinear operator , where and are separable Hilbert spaces. Introducing the concept of singular value and ordered singular value, we prove that if is compact, and its singular values are ordered, then has a Schmidt representation on real Hilbert spaces. We prove that the hypothesis of existence of ordered singular values is fundamental. 相似文献
6.
《Discrete Mathematics》2019,342(5):1275-1292
A discrete function of variables is a mapping , where , and are arbitrary finite sets. Function is called separable if there exist functions for , such that for every input the function takes one of the values . Given a discrete function , it is an interesting problem to ask whether is separable or not. Although this seems to be a very basic problem concerning discrete functions, the complexity of recognition of separable discrete functions of variables is known only for . In this paper we will show that a slightly more general recognition problem, when is not fully but only partially defined, is NP-complete for . We will then use this result to show that the recognition of fully defined separable discrete functions is NP-complete for .The general recognition problem contains the above mentioned special case for . This case is well-studied in the context of game theory, where (separable) discrete functions of variables are referred to as (assignable) -person game forms. There is a known sufficient condition for assignability (separability) of two-person game forms (discrete functions of two variables) called (weak) total tightness of a game form. This property can be tested in polynomial time, and can be easily generalized both to higher dimension and to partially defined functions. We will prove in this paper that weak total tightness implies separability for (partially defined) discrete functions of variables for any , thus generalizing the above result known for . Our proof is constructive. Using a graph-based discrete algorithm we show how for a given weakly totally tight (partially defined) discrete function of variables one can construct separating functions in polynomial time with respect to the size of the input function. 相似文献
7.
The -additive codes are subgroups of , and can be seen as linear codes over when , -additive codes when , or -additive codes when . A -linear generalized Hadamard (GH) code is a GH code over which is the Gray map image of a -additive code. Recursive constructions of -additive GH codes of type with are known. In this paper, we generalize some known results for -linear GH codes with to any prime when , and then we compare them with the ones obtained when . First, we show for which types the corresponding -linear GH codes are nonlinear over . Then, for these codes, we compute the kernel and its dimension, which allow us to classify them completely. Moreover, by computing the rank of some of these codes, we show that, unlike -linear Hadamard codes, the -linear GH codes are not included in the family of -linear GH codes with when prime. Indeed, there are some families with infinite nonlinear -linear GH codes, where the codes are not equivalent to any -linear GH code with . 相似文献
8.
9.
In this article, we study the structure of finitely ramified mixed characteristic valued fields. For any two complete discrete valued fields and of mixed characteristic with perfect residue fields, we show that if the n-th residue rings are isomorphic for each , then and are isometric and isomorphic. More generally, for , there is depending only on the ramification indices of and such that any homomorphism from the -th residue ring of to the -th residue ring of can be lifted to a homomorphism between the valuation rings. Moreover, we get a functor from the category of certain principal Artinian local rings of length n to the category of certain complete discrete valuation rings of mixed characteristic with perfect residue fields, which naturally generalizes the functorial property of unramified complete discrete valuation rings. Our lifting result improves Basarab's relative completeness theorem for finitely ramified henselian valued fields, which solves a question posed by Basarab, in the case of perfect residue fields. 相似文献
10.
11.
An important problem on almost perfect nonlinear (APN) functions is the existence of APN permutations on even-degree extensions of larger than 6. Browning et al. (2010) gave the first known example of an APN permutation on the degree-6 extension of . The APN permutation is CCZ-equivalent to the previously known quadratic Kim κ-function (Browning et al. (2009)). Aside from the computer based CCZ-inequivalence results on known APN functions on even-degree extensions of with extension degrees less than 12, no theoretical CCZ-inequivalence result on infinite families is known. In this paper, we show that Gold and Kasami APN functions are not CCZ-equivalent to permutations on infinitely many even-degree extensions of . In the Gold case, we show that Gold APN functions are not equivalent to permutations on any even-degree extension of , whereas in the Kasami case we are able to prove inequivalence results for every doubly-even-degree extension of . 相似文献
12.
Kreweras conjectured that every perfect matching of a hypercube for can be extended to a hamiltonian cycle of . Fink confirmed the conjecture to be true. It is more general to ask whether every perfect matching of for can be extended to two or more hamiltonian cycles of . In this paper, we prove that every perfect matching of for can be extended to at least different hamiltonian cycles of . 相似文献
13.
A graph is -colorable if it admits a vertex partition into a graph with maximum degree at most and a graph with maximum degree at most . We show that every -free planar graph is -colorable. We also show that deciding whether a -free planar graph is -colorable is NP-complete. 相似文献
14.
The tensor product of graphs , and is defined by and Let be the fractional chromatic number of a graph . In this paper, we prove that if one of the three graphs , and is a circular clique, 相似文献
15.
Let be an array of nonnegative numbers satisfying the recurrence relation with and unless . In this paper, we first prove that the array can be generated by some context-free Grammars, which gives a unified proof of many known results. Furthermore, we present criteria for real rootedness of row-generating functions and asymptotical normality of rows of . Applying the criteria to some arrays related to tree-like tableaux, interior and left peaks, alternating runs, flag descent numbers of group of type , and so on, we get many results in a unified manner. Additionally, we also obtain the continued fraction expansions for generating functions related to above examples. As results, we prove the strong -log-convexity of some generating functions. 相似文献
16.
17.
This paper studies the properties of -symmetric vector random fields in , whose direct/cross covariances are functions of -norm. The spectral representation and a turning bands expression of the covariance matrix function are derived for an -symmetric vector random field that is mean square continuous. We also establish an integral relationship between an -symmetric covariance matrix function and an isotropic one. In addition, a simple but efficient approach is proposed to construct the -symmetric random field in , whose univariate marginal distributions may be taken as arbitrary infinitely divisible distribution with finite variance. 相似文献
18.
19.
In the two disjoint shortest paths problem ( 2-DSPP), the input is a graph (or a digraph) and its vertex pairs and , and the objective is to find two vertex-disjoint paths and such that is a shortest path from to for , if they exist. In this paper, we give a first polynomial-time algorithm for the undirected version of the 2-DSPP with an arbitrary non-negative edge length function. 相似文献