Strongly Non-Regularity of Order Bounded Operators

A method to construct strongly non regular order bounded operators from a classical Banach lattice C into any separable Banach lattice F without Dedekind σ completeness is presented in this paper. A result concerning the order bounded norm and the regular norm is also contained.

On Strongly Regular Rings

In this paper we investigate strongly regular rings. In terms of W-ideals of rings some characterizations of strongly regular rings are given.

Search algorithm on strongly regular graphs based on scattering quantum walks

Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs（SRGs） with parameters（N, k, λ, μ） achieves full quantum speedup. The problem is reconsidered in terms of scattering quantum walk, a type of discrete-time quantum walks. Here, the search space is confined to a low-dimensional subspace corresponding to the collapsed graph of SRGs. To quantify the algorithm＇s performance, we leverage the fundamental pairing theorem, a general theory developed by Cottrell for quantum search of structural anomalies in star graphs.The search algorithm on the SRGs with k scales as N satisfies the theorem, and results can be immediately obtained, while search on the SRGs with k scales as√N does not satisfy the theorem, and matrix perturbation theory is used to provide an analysis. Both these cases can be solved in O（√N） time steps with a success probability close to 1. The analytical conclusions are verified by simulation results on two SRGs. These examples show that the formalism on star graphs can be applied more generally.

A Note on Strongly Regular Self-complementary Graphs

Koetzig put forward a question on strongly-regular self-complementary graphs, that is, for any natural number k, whether there exists a strongLy-regular self- complementary graph whose order is 4k ＋ 1, where 4k ＋ 1 = x^2 ＋ y^2, x and y are positive integers; what is the minimum number that made there exist at least two non-isomorphic strongly-regular self-complementary graphs. In this paper, we use two famous lemmas to generalize the existential conditions for strongly-regular self-complementary circular graphs with 4k ＋ 1 orders.

Relational Representations of Strongly Algebraic Lattices

In this paper,we introduce and investigate the strongly regular relation.Then we give the relational representations and an intrinsic characterization of strongly algebraic lattices via mapping relation and strongly regular relation.

Generalized Krein Parameters of a Strongly Regular Graph

We consider the real three-dimensional Euclidean Jordan algebra associated to a strongly regular graph. Then, the Krein parameters of a strongly regular graph are generalized and some generalized Krein admissibility conditions are deduced. Furthermore, we establish some relations between the classical Krein parameters and the generalized Krein parameters.

强非线性规则波中内倾船的甲板上浪数值研究

Owing to the large amplitude and nonlinearity of extreme sea waves,sailing ships exhibit obvious large-amplitude motion and green water.For a tumblehome vessel,a low-tumblehome freeboard and wave-piercing bow make green water more likely.To study the green water of a wave-facing sailing tumblehome vessel in strong nonlinear regular waves,the computational fluid dynamics software STAR-CCM+was used.The Reynolds-averaged Navier–Stokes method was used for the numerical simulation,and the k-epsilon model was adopted to deal with viscous turbulence.The volume of the fluid method was used to capture the free surface,and overset grids were utilized to simulate the large-amplitude ship motion.This study delves into the influence of wave height on the ship motion response and a tumblehome vessel green water under a large wave steepness(0.033≤H/λ≤0.067)at Fr=0.22.In addition,the dynamic process of green water and the“wave run-up”phenomenon were evaluated.The results suggest that when the wavelength is equal to the ship length and the wave steepness increases to 0.056,the increase in the water height on the deck is obvious.However,the wave height had little effect on the green water duration.The wave steepness and“backwater”have a great impact on the value and number of the peak of the water height on the deck.When the wave steepness exceeded 0.056,the water climbed up,and the plunging-type water body was formed at the top of the wave baffle,resulting in a large water area on the deck.

von Neumann正则环与右SF-环

A ring R is called a left (right) SF-ring if all simple left (right) R-modules are flat. It is known that von Neumann regular rings are left and right SF-rings. In this paper, we study the regularity of right SF-rings and prove that if R is a right SF-ring whose all maximal (essential) right ideals are GW-ideals, then R is regular.

ON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES

In this paper, an equivalent condition of a graph G with t （2≤ t ≤n） distinct Laplacian eigenvalues is established. By applying this condition to t = 3, if G is regular （necessarily be strongly regular）, an equivalent condition of G being Laplacian integral is given. Also for the case of t = 3, if G is non-regular, it is found that G has diameter 2 and girth at most 5 if G is not a tree. Graph G is characterized in the case of its being triangle-free, bipartite and pentagon-free. In both cases, G is Laplacian integral.

A family of generalized strongly regular graphs of grade 2

A generalized strongly regular graphof grade p,as anew generalization of strongly regular graphs,is a regular graph such that the number of common neighbours of both any two adjacent vertices and any two non-adjacent vertices takes on p distinct values.For any vertex u of a generalized strongly regular graph of grade 2 with parameters(n,k;a_(1),a_(2);c_(1),c_(2)),if the number of the vertices that are adjacent to u and share ai(i=1,2)common neighbours with u,or are non-adjacent to u and share c,(i=1,2)common neighbours with is independent of the choice of the vertex u,then the generalized strongly regular graph of grade 2 is free.In this paper,we investigate the generalized strongly regular graph of grade 2 with parameters(n,k;k-1,a_(2);k-1,c_(2))and provide the sufficient and necessary conditions for the existence of a family of free generalized strongly regular graphs of grade 2.

Some results on strongly regular graphs from unions of cyclotomic classes

In this paper, we construct some families of strongly regular graphs on finite fields by using unions of cyclotomic classes and index 2 Gauss sums. New infinite families of strongly regular graphs are found.

Small Directed Strongly Regular Graphs

The goal of the present paper is to provide a gallery of small directed strongly regular graphs.For each graph of order n≤12 and valency k<n/2,a diagram is depicted,its relation to other small directed strongly regular graphs is revealed,the full group of automorphisms is described,and some other nice properties are given.To each graph a list of interesting subgraphs is provided as well.

Strongly Regular (α,β)-Families and Translation Strongly Regular (α,β)-Geometries

In this paper, we introduce the concept of a strongly regular (α,β)-family. It gener- alizes the concept of an SPG-family in [4] and [5]. We provide a method of constructing strongly regular (α,β)-geometries from strongly regular (α,β)-families. Furthermore, we prove that each strongly regular (α,β)-geometry constructed from a strongly regular (α,β)-regulus translation is isomorphic to a translation strongly regular (α,β)-geometry; while t - r > β, the converse is also true.

Codes From Strongly Regular (α,β)-reguli

Strongly regular (α,β)-reguli are a class of incidence structures with given conditions which were introduced by Hamilton and Mathon. We introduce two classes of codes constructed from strongly regular (α,β)-reguli within PG(k-1,q). The codes are related with two-weight codes intimately.

The Adjacency Codes of the First Yellow Graphs

The authors study the binary codes spanned by the adjacency matrices of the strongly regular graphs(SRGs)on at most two hundred vertices whose existence is unknown.The authors show that in length less than one hundred they cannot be cyclic,except for the exceptions of the SRGs of parameters(85,42,20,21)and(96,60,38,36).In particular,the adjacency code of a(85,42,20,21)is the zero-sum code.In the range[100,200]the authors find 29 SRGs that could possibly have a cyclic adjacency code.

Erds-Ko-Rado theorems in certain semilattices

Suda （2012） extended the ErdSs-Ko-Rado theorem to designs in strongly regularized semilattices. In this paper we generalize Suda＇s results in regularized semilattices and partition regularized semilattices, give many examples for these semilattices and obtain their intersection theorems.

New Partial Geometric Difference Sets and Partial Geometric Difference Families

Using Galois rings and Galois fields, we construct several infinite classes of partial geometric difference sets, and partial geometric difference families, with new parameters. Furthermore, these partial geometric difference sets(and partial geometric difference families) correspond to new infinite families of directed strongly regular graphs. We also discuss some of the links between partially balanced designs, 2-adesigns(which were recently coined by Cunsheng Ding in "Codes from Difference Sets"(2015)), and partial geometric designs, and make an investigation into when a 2-adesign is a partial geometric design.

Geometry Theorem Proving by Decomposing Polynomial System into Strong Regular Sets

This paper presents a complete method to prove geometric theorem by decomposing the corresponding polynomial system. into strong regular sets, by which one can compute some components for which the geometry theorem is true and exclude other components for which the geometry theorem is false. Two examples are given to show that the geometry theorems are conditionally true for some components which are excluded by other methods.

Inverse Problems in Graph Theory: Nets

Let Г be a distance-regular graph of diameter 3 with strong regular graph Г_(3).The determination of the parameters Г_(3) over the intersection array of the graph Г is a direct problem.Finding an intersection array of the graph Г with respect to the parameters Г_(3) is an inverse problem.Previously,inverse problemswere solved for Г_(3) by Makhnev and Nirova.In this paper,we study the intersection arrays of distance-regular graph Г of diameter 3,for which the graph Г_(3) is a pseudo-geometric graph of the net PGm(n,m).New infinite series of admissible intersection arrays for these graphs are found.We also investigate the automorphisms of distance-regular graph with the intersection array{20,16,5;1,1,16}.

On the Nonexistence of Partial Difference Sets by Projections to Finite Fields

In the study of(partial)difference sets and their generalizations in groups G,the most widely used method is to translate their definition into an equation over group ring Z[G]and to investigate this equation by applying complex representations of G.In this paper,we investigate the existence of(partial)difference sets in a different way.We project the group ring equations in Z[G]to Z[N]where N is a quotient group of G isomorphic to the additive group of a finite field,and then use polynomials over this finite field to derive some existence conditions.