scholarly journals New Quaternary Codes Derived from Posets of the Disjoint Union of Two Chains

2020 ◽  
Vol 24 (1) ◽  
pp. 20-24
Author(s):  
Xiaomeng Zhu ◽  
Yansheng Wu ◽  
Qin Yue
Keyword(s):  
Disjoint Union ◽  
Quaternary Codes

DENSE STABLE RANK AND RUNGE-TYPE APPROXIMATION THEOREMS FOR MAPS

2021 ◽  
pp. 1-29
Author(s):  
ALEXANDER BRUDNYI
Keyword(s):  
Disjoint Union ◽  
A Priori ◽  
Holomorphic Functions ◽  
Stable Rank ◽  
Open Unit ◽  
Uniform Estimates ◽  
Approximation Theorems ◽  
Type Approximation ◽  
Similar Approximation ◽  
Bounded Holomorphic

Abstract Let $H^\infty ({\mathbb {D}}\times {\mathbb {N}})$ be the Banach algebra of bounded holomorphic functions defined on the disjoint union of countably many copies of the open unit disk ${\mathbb {D}}\subset {{\mathbb C}}$ . We show that the dense stable rank of $H^\infty ({\mathbb {D}}\times {\mathbb {N}})$ is $1$ and, using this fact, prove some nonlinear Runge-type approximation theorems for $H^\infty ({\mathbb {D}}\times {\mathbb {N}})$ maps. Then we apply these results to obtain a priori uniform estimates of norms of approximating maps in similar approximation problems for the algebra $H^\infty ({\mathbb {D}})$ .

UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES

2014 ◽  
Vol 79 (4) ◽  
pp. 1001-1019 ◽  
Author(s):  
ASHER M. KACH ◽  
ANTONIO MONTALBÁN
Keyword(s):  
Direct Product ◽  
Disjoint Union ◽  
Second Order ◽  
Linear Orders ◽  
Second Order Arithmetic ◽  
Order Arithmetic ◽  
Natural Classes ◽  
Product Of Groups

AbstractMany classes of structures have natural functions and relations on them: concatenation of linear orders, direct product of groups, disjoint union of equivalence structures, and so on. Here, we study the (un)decidability of the theory of several natural classes of structures with appropriate functions and relations. For some of these classes of structures, the resulting theory is decidable; for some of these classes of structures, the resulting theory is bi-interpretable with second-order arithmetic.

Bounding Fitting Heights of Two Classes of Character Degree Graphs

2014 ◽  
Vol 21 (02) ◽  
pp. 355-360
Author(s):  
Xianxiu Zhang ◽  
Guangxiang Zhang
Keyword(s):  
Solvable Group ◽  
Disjoint Union ◽  
Character Degree ◽  
Finite Solvable Group ◽  
Total Degree ◽  
Character Degree Graph ◽  
Vertex Set ◽  
Fitting Height ◽  
Degree Graph

In this article, we prove that a finite solvable group with character degree graph containing at least four vertices has Fitting height at most 4 if each derived subgraph of four vertices has total degree not more than 8. We also prove that if the vertex set ρ(G) of the character degree graph Δ(G) of a solvable group G is a disjoint union ρ(G) = π1 ∪ π2, where |πi| ≥ 2 and pi, qi∈ πi for i = 1,2, and no vertex in π1 is adjacent in Δ(G) to any vertex in π2 except for p1p2 and q1q2, then the Fitting height of G is at most 4.

scholarly journals Remarks on Stationary and Uniformly-rotating Vortex Sheets: Rigidity Results

2021 ◽  
Author(s):  
Javier Gómez-Serrano ◽  
Jaemin Park ◽  
Jia Shi ◽  
Yao Yao
Keyword(s):  
Angular Velocity ◽  
Disjoint Union ◽  
Vortex Sheet ◽  
Vortex Sheets ◽  
Smooth Curves ◽  
Rigidity Results ◽  
Positive Vorticity ◽  
Constant Vorticity ◽  
Concentric Circles ◽  
Finite Disjoint Union

AbstractIn this paper, we show that the only solution of the vortex sheet equation, either stationary or uniformly rotating with negative angular velocity $$\Omega $$ Ω , such that it has positive vorticity and is concentrated in a finite disjoint union of smooth curves with finite length is the trivial one: constant vorticity amplitude supported on a union of nested, concentric circles. The proof follows a desingularization argument and a calculus of variations flavor.

Exceptional sets related to the largest digits in Lüroth expansions

2021 ◽  
pp. 1-15
Author(s):  
Shuyi Lin ◽  
Jinjun Li ◽  
Manli Lou
Keyword(s):  
Number Theory ◽  
Hausdorff Dimension ◽  
Level Sets ◽  
Disjoint Union ◽  
Exceptional Set ◽  
Exceptional Sets ◽  
Lüroth Expansion

Let [Formula: see text] denote the largest digit of the first [Formula: see text] terms in the Lüroth expansion of [Formula: see text]. Shen, Yu and Zhou, A note on the largest digits in Luroth expansion, Int. J. Number Theory 10 (2014) 1015–1023 considered the level sets [Formula: see text] and proved that each [Formula: see text] has full Hausdorff dimension. In this paper, we investigate the Hausdorff dimension of the following refined exceptional set: [Formula: see text] and show that [Formula: see text] has full Hausdorff dimension for each pair [Formula: see text] with [Formula: see text]. Combining the two results, [Formula: see text] can be decomposed into the disjoint union of uncountably many sets with full Hausdorff dimension.

The Weakly Nilpotent Graph of a Commutative Ring

2017 ◽  
Vol 60 (2) ◽  
pp. 319-328
Author(s):  
Soheila Khojasteh ◽  
Mohammad Javad Nikmehr
Keyword(s):  
Commutative Ring ◽  
Chromatic Number ◽  
Disjoint Union ◽  
Independence Number ◽  
Artinian Ring ◽  
Clique Number ◽  
Commutative Rings ◽  
Unicyclic Graph ◽  
Nilpotent Elements ◽  
Vertex Set

AbstractLet R be a commutative ring with non-zero identity. In this paper, we introduce theweakly nilpotent graph of a commutative ring. The weakly nilpotent graph of R denoted by Γw(R) is a graph with the vertex set R* and two vertices x and y are adjacent if and only if x y ∊ N(R)*, where R* = R \ {0} and N(R)* is the set of all non-zero nilpotent elements of R. In this article, we determine the diameter of weakly nilpotent graph of an Artinian ring. We prove that if Γw(R) is a forest, then Γw(R) is a union of a star and some isolated vertices. We study the clique number, the chromatic number, and the independence number of Γw(R). Among other results, we show that for an Artinian ring R, Γw(R) is not a disjoint union of cycles or a unicyclic graph. For Artinan rings, we determine diam . Finally, we characterize all commutative rings R for which is a cycle, where is the complement of the weakly nilpotent graph of R.

scholarly journals Planar Graphs have Independence Ratio at least 3/13

10.37236/5309 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Daniel W. Cranston ◽  
Landon Rabern
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Disjoint Union ◽  
Independence Number ◽  
Independent Set

The 4 Color Theorem (4CT) implies that every $n$-vertex planar graph has an independent set of size at least $\frac{n}4$; this is best possible, as shown by the disjoint union of many copies of $K_4$.  In 1968, Erdős asked whether this bound on independence number could be proved more easily than the full 4CT. In 1976 Albertson showed (independently of the 4CT) that every $n$-vertex planar graph has an independent set of size at least $\frac{2n}9$. Until now, this remained the best bound independent of the 4CT. Our main result improves this bound to $\frac{3n}{13}$.

scholarly journals Enumeration of the Edge Weights of Symmetrically Designed Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Muhammad Javaid ◽  
Hafiz Usman Afzal ◽  
Ebenezer Bonyah
Keyword(s):  
Disjoint Union ◽  
Antimagic Labeling ◽  
Pancyclic Graphs

The idea of super a , 0 -edge-antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses super a , 0 -edge-antimagic labeling of a biparametric family of pancyclic graphs. We also present the aforesaid labeling on the disjoint union of graphs comprising upon copies of C 4 and different trees. Several problems shall also be addressed in this article.

scholarly journals Iterative Properties of Birational Rowmotion I: Generalities and Skeletal Posets

10.37236/4334 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Darij Grinberg ◽  
Tom Roby
Keyword(s):  
Finite Order ◽  
Disjoint Union ◽  
Parallel Analysis ◽  
Birational Map ◽  
Finite Poset ◽  
Order Ideals ◽  
Set Up ◽  
Grafting Onto

We study a birational map associated to any finite poset $P$. This map is a far-reaching generalization (found by Einstein and Propp) of classical rowmotion, which is a certain permutation of the set of order ideals of $P$. Classical rowmotion has been studied by various authors (Fon-der-Flaass, Cameron, Brouwer, Schrijver, Striker, Williams and many more) under different guises (Striker-Williams promotion and Panyushev complementation are two examples of maps equivalent to it). In contrast, birational rowmotion is new and has yet to reveal several of its mysteries. In this paper, we set up the tools for analyzing the properties of iterates of this map, and prove that it has finite order for a certain class of posets which we call "skeletal". Roughly speaking, these are graded posets constructed from one-element posets by repeated disjoint union and "grafting onto an antichain"; in particular, any forest having its leaves all on the same rank is such a poset. We also make a parallel analysis of classical rowmotion on this kind of posets, and prove that the order in this case equals the order of birational rowmotion.

Sign in / Sign up

Export Citation Format

Share Document