In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to these partial orders. The partial orders under consideration include those related with some Laplacian characteristics of graphs as well as with some probabilistic characteristics of graphs with randomly deleted edges. Section 2 provides some notions, notation, and simple observations. Section 3 contains some basic facts on the Laplacian polynomial of a graph. Section 4 describes various graph operation and their properties. In Section 5 we introduce some partial orders on the set of (m,n)-graphs related, in particular, with the graph Laplacian and the graph reliability (Laplacian posets and reliability posets}). Section 6 contains some old and recent results on the monotonicity of some graph operations with respect to Laplacian posets. Section 7 and 8 include some old and recent results on the monotonicity of some graph operations with respect to reliability posets and to some other parameters of graphs as well as some open problems. Section 9 co
We constructed some tensor functors that send each exceptional sequence in a module category to another exceptional sequence in another module category by using split extensions and recollements.
This paper is devoted to a general presentation of anti-topological spaces. These structures have been initially proposed by Şahin, Kargın and M. Yücel in 2021. We analyse their basic definition, showing some of its subtleties and implications. The framework thus obtained is used to investigate anti-topological interpretation of some basic topological notions. For example, we discuss the idea of interior and closure and we show some results on door spaces. Moreover, we introduce two non-equivalent types of continuity. Finally, we investigate the idea of density and nowhere density. Finally, we give some preliminary suggestions concerning the modal logic of anti-topological spaces. It is noteworthy that the paper contains some additional remarks on infra-topological and weak spaces. They may be considered as a clarification or correction of some earlier results present in literature.
We point out that the ideas underlying some test procedures recently proposed for testing post-model-selection (and for some other test problems) in the econometrics literature have been around for quite some time in the statistics literature. We also sharpen some of these results in the statistics literature. Furthermore, we show that some intuitively appealing testing procedures, that have found their way into the econometrics literature, lead to tests that do not have desirable size properties, not even asymptotically.
The aim of these notes is to study some of the structural aspects of the ring of arithmetical functions. We prove that this ring is neither Noetherian nor Artinian. Furthermore, we construct various types of prime ideals. We show arithmetic ring has infinite Krull dimension and its associated prime ideal set is nonempty.
We offer some further applications of some Bailey pairs related to some mock theta functions which were established in a recent study. We discuss and offer some double-sum $q$-series, with new relationships among mock theta functions. We also offer a new relationship between the Bailey pair of Bringmann and Kane with that of Andrews.
The first section of this modest survey reviews some basic notions and describes some families of examples, and the second section briefly indicates some general aspects of analysis on metric spaces. The remaining three sections are concerned with some particular situations involving sub-Riemannian geometry, hyperbolic groups, and p-adic numbers.
In this study, we explore the interrelation between hypergraph symmetries represented by equivalence relations on the vertex set and the spectra of operators associated with the hypergraph. We introduce the idea of equivalence relation compatible operators related to hypergraphs. Some eigenvalues and the corresponding eigenvectors can be computed directly from the equivalence classes of the equivalence relation. The other eigenvalues can be computed from a quotient operator obtained by identifying each equivalence class as an element. We provide an equivalence relation $\mathfrak{R}_s$ on the vertex set of a hypergraph such that the Adjacency, Laplacian, and signless Laplacian operators associated with that hypergraph become $\mathfrak{R}_s$-compatible. The $\mathfrak{R}_s$-equivalence classes are named as units. Using units, we find some more symmetric substructures of hypergraphs called twin units, regular sets, co-regular sets, and symmetric sets. We collectively classify them as building blocks of hypergraphs. We show that the presence of these building blocks leaves certain traces in the spectrum and the corresponding eigenspaces of the $\mathfrak{R}_s$-compatible operators as
The aim is to compare a few Nucleon-Nucleon (NN) potentials especially Reid68, Reid68-Day, Reid93, UrbanaV14, ArgonneV18, Nijmegen 93, Nijmegen I and Nijmegen II. Although these potentials have some likenesses and are almost phenomenological, they include in general different structures and their own characteristics. The potentials are constructed in a manner that fit the NN scattering data or phase shifts and are compared in this way. A high-quality scale of a potential is that it fits the data with $χ^{2}/N_{data} \approx 1$, describes well the deuteron properties and gives satisfactory results in nuclear-structure calculations. However, these scales have some failures. Here, we first compare many potentials by confronting them with the data. Then, we try to compare the potential forms by considering the potential structures directly and therefore regarding their substantial bases somehow. To do so, we note that since the potentials are written in different schemas, it is necessary to write them in a unique schema. On the other hand, because three major terms in the NN interaction are central, tensor and spin-orbit terms; so, to perform a reduction plan and arrive at a common str
The middle binomial coefficients can be interpreted as numbers of Motzkin paths which have no horizontal steps at positive heights. Assigning suitable weights gives some nice polynomial extensions. We determine the Hankel determinants and their generating functions for the middle binomial coefficients and derive many conjectures for their polynomial extensions. Finally, we explore experimentally some modifications of the middle binomial coefficients whose Hankel determinants show an interesting modular pattern and obtain some q-analogs.
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which minimize some forms of graph cut. Previous research already gave some results about the cut bounds for unweighted regular graph. In this paper, we prove a result about the lower bound for weighted graphs that have some regular properties and show similar results for more general case.
From some works of P. Furtwängler and H.S. Vandiver, we put the basis of a new cyclotomic approach to Fermat's last theorem for p>3 and to a stronger version called SFLT, by introducing governing fields of the form Q(exp(2 i pi/q-1)) for prime numbers q. We prove for instance that if there exist infinitely many primes q, q not congruent to 1 mod p, q^(p-1) not congruent to 1 mod p^2, such that for Q dividing q in Q(exp(2 i pi /q-1)), we have Q^(1-c) = A^p . (alpha), with alpha congruent to 1 mod p^2 (where c is the complex conjugation), then Fermat's last theorem holds for p. More generally, the main purpose of the paper is to show that the existence of nontrivial solutions for SFLT implies some strong constraints on the arithmetic of the fields Q(exp(2 i pi /q-1)). From there, we give sufficient conditions of nonexistence that would require further investigations to lead to a proof of SFLT, and we formulate various conjectures. This text must be considered as a basic tool for future researchs (probably of analytic or geometric nature) - This second version includes some corrections in the English language, an in depth study of the case p=3 (especially Theorem 8), further detail
In 2010, Grigoriev and Shpilrain, introduced some graph-based authentication schemes. We present a cryptanalysis of some of these protocols, and introduce some new schemes to fix the problems.
The Toba supereruption 74,000 years ago was so massive it may have plunged Earth into years of darkness and cold, leading some scientists to believe humanity nearly went extinct。 Yet archaeological evidence from Africa and Asia suggests early humans were far more resilient than once thought。 Instead of disappearing, some communities adapted with ne
We explore some aspects of monodromies of D-branes in the Kahler moduli space of Calabi-Yau compactifications. Here a D-brane is viewed as an object of the derived category of coherent sheaves. We compute all the interesting monodromies in some nontrivial examples and link our work to recent results and conjectures concerning helices and mutations. We note some particular properties of the 0-brane.
In this letter, we study some evolution networks that grow with linear preferential attachment. Based upon some recent results on the quotient Gamma function, we give a rigorous proof of the asymptotic Mandelbrot law for the degree distribution $p_k \propto (k + c)^{-γ}$ in certain conditions. We also analytically derive the best fitting values for the scaling exponent $γ$ and the shifting coefficient $c$.
Bose-Chaudhuri-Hocquenghem (BCH) codes have been intensively investigated. Even so, there is only a little known about primitive BCH codes, let alone non-primitive ones. In this paper, let $q>2$ be a prime power, the dimension of a family of non-primitive BCH codes of length $n=q^{m}+1$ (also called antiprimitive) is studied. These codes are also linear codes with complementary duals (called LCD codes). Through some approaches such as iterative algorithm, partition and scaling, all coset leaders of $C_{x}$ modulo $n$ with $q^{\lceil \frac{m}{2}\rceil}<x\leq 2q^{\lceil\frac{m}{2} \rceil}+2$ are given for $m\geq 4$. And for odd $m$ the first several largest coset leaders modulo $n$ are determined. Furthermore, a new kind of sequences is introduced to determine the second largest coset leader modulo $n$ with $m$ even and $q$ odd. Also, for even $m$ some conjectures about the first several coset leaders modulo $n$ are proposed, whose complete verification would wipe out the difficult problem to determine the first several coset leaders of antiprimitive BCH codes. After deriving the cardinalities of the coset leaders, we shall calculate exact dimensions of many antiprimitive LCD B
Let $R$ be a commutative Noetherian ring with non-zero identity, $\fa$ an ideal of $R$, $M$ a finite $R$--module and $X$ an arbitrary $R$--module. Here, we show that, in the Serre subcategories of the category of $R$--modules, how the generalized local cohomology modules, the ordinary local cohomology modules and the extension modules behave similarly at the initial points. We conclude some Artinianness and cofiniteness results for $\lc^{n}_{\fa}(M, X)$, and some finiteness results for $\Supp_R(\lc^{n}_{\fa}(M, X))$ and $\Ass_R(\lc^{n}_{\fa}(M, X))$.
We study the lower bounds and upper bounds for LS-category and equivariant LS-category. In particular we compute both invariants for torus manifolds. There are some examples to show the sharpness of conditions in the theorems. Moreover the equivariant LS-category of the product space is discussed and counterexamples of some previous results are given.
Present-day deep neural networks for video semantic segmentation require a large number of fine-grained pixel-level annotations to achieve the best possible results. Obtaining such annotations, however, is very expensive. On the other hand, raw, unannotated video frames are practically free to obtain. Similarly, coarse annotations, which do not require precise boundaries, are also much cheaper. This paper investigates approaches to reduce the annotation cost required for video segmentation datasets by utilising such resources. We show that using state-of-the-art segmentation foundation models, Segment Anything Model (SAM) and Segment Anything Model 2 (SAM 2), we can utilise both unannotated frames as well as coarse annotations to alleviate the effort required for manual annotation of video segmentation datasets by automating mask generation. Our investigation suggests that if used appropriately, we can reduce the need for annotation by a third with similar performance for video semantic segmentation. More significantly, our analysis suggests that the variety of frames in the dataset is more important than the number of frames for obtaining the best performance.