scholarly journals A combinatorial proof of a decomposition property of reduced residue systems

2016 ◽  
Vol 9 (3) ◽  
pp. 361-366
Author(s):  
Yotsanan Meemark ◽  
Thanakorn Prinyasart
Keyword(s):  
Combinatorial Proof ◽  
Decomposition Property ◽  
Residue Systems

Detection of pitted morningglory (Ipomoea lacunosa) by hyperspectral remote sensing. I. Effects of tillage and cover crop residue

Weed Science ◽  
2004 ◽  
Vol 52 (2) ◽  
pp. 222-229 ◽  
Author(s):  
Clifford H. Koger ◽  
David R. Shaw ◽  
Krishna N. Reddy ◽  
Lori M. Bruce
Keyword(s):  
Cover Crop ◽  
Crop Residue ◽  
Field Experiments ◽  
Leaf Growth ◽  
Plant Size ◽  
Hyperspectral Reflectance ◽  
Discrimination Accuracy ◽  
Reflectance Measurement ◽  
Pitted Morningglory ◽  
Residue Systems

Field experiments were conducted to evaluate the potential of hyperspectral reflectance data collected with a hand-held spectroradiometer to discriminate soybean intermixed with pitted morningglory and weed-free soybean in conventional till and no-till plots containing rye, hairy vetch, or no cover crop residue. Pitted morningglory was in the cotyledon to six-leaf growth stage. Seven 50-nm spectral bands (one ultraviolet, two visible, four near-infrared) derived from each hyperspectral reflectance measurement were used as discrimination variables. Pitted morningglory plant size had more influence on discriminant capabilities than tillage or cover crop residue systems. Across all tillage and residue systems, discrimination accuracy was 71 to 95%, depending on the size of pitted morningglory plants at the time of data acquisition. The versatility of the seven 50-nm bands was tested by using a discriminant model developed for one experiment location to test discriminant capabilities for the other experiment, with discrimination accuracy across all tillage and residue systems of 55 to 73%, depending on pitted morningglory plant size.

scholarly journals COMBINATORIAL KNOT FLOER HOMOLOGY AND DOUBLE BRANCHED COVERS

2013 ◽  
Vol 22 (06) ◽  
pp. 1350014
Author(s):  
FATEMEH DOUROUDIAN
Keyword(s):  
Floer Homology ◽  
Combinatorial Proof ◽  
Branched Covers ◽  
Knot Floer Homology ◽  
Branched Cover ◽  
Heegaard Diagram

Using a Heegaard diagram for the pullback of a knot K ⊂ S3 in its double branched cover Σ2(K), we give a combinatorial proof for the invariance of the associated knot Floer homology over ℤ.

ON ∞-COMPLEX SYMMETRIC OPERATORS

2017 ◽  
Vol 60 (1) ◽  
pp. 35-50
Author(s):  
MUNEO CHŌ ◽  
EUNGIL KO ◽  
JI EUN LEE
Keyword(s):  
Spectral Properties ◽  
Symmetric Operator ◽  
Complex Symmetric Operator ◽  
Decomposition Property ◽  
Complex Symmetric ◽  
Symmetric Operators

AbstractIn this paper, we study spectral properties and local spectral properties of ∞-complex symmetric operators T. In particular, we prove that if T is an ∞-complex symmetric operator, then T has the decomposition property (δ) if and only if T is decomposable. Moreover, we show that if T and S are ∞-complex symmetric operators, then so is T ⊗ S.

scholarly journals Truncated Series with Nonnegative Coefficients from the Jacobi Triple Product

2022 ◽  
Vol Volume 44 - Special... ◽  
Author(s):  
Liuquan Wang
Keyword(s):  
Analogous Result ◽  
Triple Product ◽  
Combinatorial Proof ◽  
Jacobi’S Triple Product Identity ◽  
Product Identity ◽  
Pentagonal Number Theorem ◽  
Nonnegative Coefficients ◽  
Jacobi's Triple Product Identity

Andrews and Merca investigated a truncated version of Euler's pentagonal number theorem and showed that the coefficients of the truncated series are nonnegative. They also considered the truncated series arising from Jacobi's triple product identity, and they conjectured that its coefficients are nonnegative. This conjecture was posed by Guo and Zeng independently and confirmed by Mao and Yee using different approaches. In this paper, we provide a new combinatorial proof of their nonnegativity result related to Euler's pentagonal number theorem. Meanwhile, we find an analogous result for a truncated series arising from Jacobi's triple product identity in a different manner.

scholarly journals Combinatorial Constructions of Weight Bases: The Gelfand-Tsetlin Basis

10.37236/305 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Patricia Hersh ◽  
Cristian Lenart
Keyword(s):  
Lie Algebras ◽  
Simple Algorithm ◽  
Irreducible Representations ◽  
Combinatorial Proof ◽  
Young Tableaux ◽  
Constructive Approach ◽  
Function Identity ◽  
New Interpretation ◽  
Combinatorial Constructions ◽  
Extremal Properties

This work is part of a project on weight bases for the irreducible representations of semisimple Lie algebras with respect to which the representation matrices of the Chevalley generators are given by explicit formulas. In the case of $\mathfrak{ sl}$$_n$, the celebrated Gelfand-Tsetlin basis is the only such basis known. Using the setup of supporting graphs developed by Donnelly, we present a new interpretation and a simple combinatorial proof of the Gelfand-Tsetlin formulas based on a rational function identity (all the known proofs use more sophisticated algebraic tools). A constructive approach to the Gelfand-Tsetlin formulas is then given, based on a simple algorithm for solving certain equations on the lattice of semistandard Young tableaux. This algorithm also implies certain extremal properties of the Gelfand-Tsetlin basis.

scholarly journals Combinatorial Proof of a Curious $q$-Binomial Coefficient Identity

10.37236/462 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Victor J. W. Guo ◽  
Jiang Zeng
Keyword(s):  
Binomial Coefficient ◽  
Combinatorial Proof ◽  
Binomial Coefficient Identity

Using the Algorithm Z developed by Zeilberger, we give a combinatorial proof of the following $q$-binomial coefficient identity $$ \sum_{k=0}^m(-1)^{m-k}{m\brack k}{n+k\brack a}(-xq^a;q)_{n+k-a}q^{{k+1\choose 2}-mk+{a\choose 2}} $$ $$=\sum_{k=0}^n{n\brack k}{m+k\brack a}x^{m+k-a}q^{mn+{k\choose 2}}, $$ which was obtained by Hou and Zeng [European J. Combin. 28 (2007), 214–227].

scholarly journals Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals

2010 ◽  
Vol 106 (1) ◽  
pp. 88 ◽  
Author(s):  
Luis A. Dupont ◽  
Rafael H. Villarreal
Keyword(s):  
Monomial Ideal ◽  
Lattice Points ◽  
Edge Ideal ◽  
Comparability Graph ◽  
Decomposition Property ◽  
Edge Ideals ◽  
Finite Poset ◽  
Integer Decomposition Property ◽  
Torsion Free ◽  
Min Cut

The normality of a monomial ideal is expressed in terms of lattice points of blocking polyhedra and the integer decomposition property. For edge ideals of clutters this property characterizes normality. Let $G$ be the comparability graph of a finite poset. If $\mathrm{cl}(G)$ is the clutter of maximal cliques of $G$, we prove that $\mathrm{cl}(G)$ satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. Then we prove that edge ideals of complete admissible uniform clutters are normally torsion free.

Sign in / Sign up

Export Citation Format

Share Document