scholarly journals Productive Use of Failure in Inductive Proof

1996 ◽  
pp. 79-111 ◽  
Author(s):  
Andrew Ireland ◽  
Alan Bundy
Keyword(s):  
Inductive Proof

scholarly journals Hook lengths in a skew Young diagram

10.37236/1309 ◽  
1997 ◽  
Vol 4 (1) ◽  
Author(s):  
Svante Janson
Keyword(s):  
Young Diagram ◽  
Character Degrees ◽  
Young Diagrams ◽  
Inductive Proof

Regev and Vershik (Electronic J. Combinatorics 4 (1997), #R22) have obtained some properties of the set of hook lengths for certain skew Young diagrams, using asymptotic calculations of character degrees. They also conjectured a stronger form of one of their results. We give a simple inductive proof of this conjecture. Very recently, Regev and Zeilberger (Annals of Combinatorics, to appear) have independently proved this conjecture.

A Hybrid Abductive Inductive Proof Procedure

2004 ◽  
Vol 12 (5) ◽  
pp. 371-397 ◽  
Author(s):  
O. Ray
Keyword(s):  
Inductive Proof ◽  
Proof Procedure

Inductive Proof Outlines for Monitors in Java

2003 ◽  
pp. 155-169 ◽  
Author(s):  
Erika Ábrahám ◽  
Frank S. de Boer ◽  
Willem-Paul de Roever ◽  
Martin Steffen
Keyword(s):  
Inductive Proof

Hex Must Have a Winner: An Inductive Proof

1976 ◽  
Vol 49 (2) ◽  
pp. 85-86 ◽  
Author(s):  
David Berman
Keyword(s):  
Inductive Proof

scholarly journals Topological generation results for free unitary and orthogonal groups

2019 ◽  
Vol 31 (01) ◽  
pp. 2050003
Author(s):  
Alexandru Chirvasitu
Keyword(s):  
Unitary Group ◽  
Free Groups ◽  
Orthogonal Groups ◽  
Factorization Property ◽  
Residually Finite ◽  
Inductive Proof ◽  
Classical Counterpart ◽  
Lower Rank ◽  
Maximal Tori ◽  
Finiteness Properties

We show that for every [Formula: see text] the free unitary group [Formula: see text] is topologically generated by its classical counterpart [Formula: see text] and the lower-rank [Formula: see text]. This allows for a uniform inductive proof that a number of finiteness properties, known to hold for all [Formula: see text], also hold at [Formula: see text]. Specifically, all discrete quantum duals [Formula: see text] and [Formula: see text] are residually finite, and hence also have the Kirchberg factorization property and are hyperlinear. As another consequence, [Formula: see text] are topologically generated by [Formula: see text] and their maximal tori [Formula: see text] (dual to the free groups on [Formula: see text] generators) and similarly, [Formula: see text] are topologically generated by [Formula: see text] and their tori [Formula: see text].

62.24 An Inductive Proof That No Permutation Is Both Even and Odd

1978 ◽  
Vol 62 (421) ◽  
pp. 211
Author(s):  
David M. Berman
Keyword(s):  
Inductive Proof

The Special Case May Be the Hardest Part

1970 ◽  
Vol 63 (3) ◽  
pp. 249-252
Author(s):  
Richard B. Thompson
Keyword(s):  
Mathematical Induction ◽  
Inductive Proof ◽  
Basic Properties ◽  
Pascal’S Triangle ◽  
Pascal's Triangle ◽  
Special Case

The use of mathematical induction seems to be a difficult topic to teach effectively because most applications of induction are either trivial or occur in complicated settings that involve too many ex traneous concepts. Recently, while teaching an elementary course, I gave an assign ment which, to everyone's surprise (my self included), led us to discover one of the basic properties of induction in a par ticularly simple context. We were discussing Pascal's triangle and the binomial co-efficients when I suggested that my stu dents give an inductive proof of the following formula.

An Inductive Proof of a Known Result about ψ(x)

2002 ◽  
Vol 109 (4) ◽  
pp. 390
Author(s):  
Andrea Vietri
Keyword(s):  
Inductive Proof
Sign in / Sign up

Export Citation Format

Share Document