text:
# User talk:JGHowes/Archive 2

January–June 2008

## Scouting barnstar

The Scouting Barnstar

-for excellent support of Scouting articles, especially in getting E. Urner Goodman to GA status. RlevseTalk 17:14, 1 January 2008 (UTC)

## Scouting WikiProject in the Signpost

We'll be in the Signpost on Wednesday, 2 Jan about 17:00 UTC, someone noticed us, be sure to read it, many of us get it, read it on my talk page if you like. RlevseTalk 02:04, 2 January 2008 (UTC)

## Ed Walker

I've noticed you've done allot work on the Ed Walker article. Found it rather interesting, I know Ed Walker, or 'Uncle Ed' as he's commonly referred to by friends. Although his hay day in radio was a bit before I can remember, too much synthetic (and quite a bit of organic) reality back in the 80s and 90s has curbed any memories of childhood lol..But anyway, I used to talk with him quite regularly when I lived in Maryland and was active on Ham Radio.. Heck, he even did some corny liners for me when I had my HF station going AM of course! Last I heard from him he was on the board of directors for the Radio and Television Museum in Bowie, Maryland. As far as I know he's still living in Bethesda. Small world.. Everybody loves Uncle Ed! :)

--DP67 (talk/contribs) 05:33, 2 January 2008 (UTC)

## Welcome!

Hello JGHowes/Archive 2! Welcome to Wikiproject Christianity! Thank you for joining. Below are some useful links to facilitate your involvement. Happy editing!
Getting Started
Miscellaneous
Work Groups
Projects
Similar WikiProjects

-- SECisek (talk) 05:57, 3 January 2008 (UTC)

## Arizona Memorial

Good pont about original research, and I guess that's why somebody pulled it. Anyway, regarding time on the memorial, the guide asked everyone to leave when the next boat came in. Apparently the rapid exhaustion of tickets that day (gone by 11 AM) encouraged a fast turnaround. I was there just after Christmas but they told me running out of tickets early was becoming routine.

And chuckle a bit. I saw your comment on WP:NAR, and the fact that you are devoted enough to use a blackberry for editing Wikipedia, made me smile. Certainly don't take offense at this, just think about how silly it might seem to the novice user, and smile. Thanks for contributing to Wikipedia!--Vox Rationis (Talk | contribs) 21:24, 7 January 2008 (UTC)

## Interested?

Hi JGHowes,

I'm an admin at a wiki called PlaneSpottingWorld, (http://plane.spottingworld.com) and you seem like the type of preson who might be interested.

SpottingWorld is an organisation who are setting up wikis for people to use for anything about the wikis topic - we allow Events, Videos, Maps - everything!

Please let me know here or there if youre interested. It's currently doing REALLY badly, and we need to build a community and get users, or else all the other wikis will also fail.

If youre not interested, please disregard this message: I am contacting you via a reccomendation by User:DP67, a member of the SpottingWorld wikis.

Thanks,

Bluegoblin7 00:00, 13 January 2008 (UTC)

## Hello...

I went to Wikipedia and it said I had a message from you (though I wasn't logged in). It took me to the talk page for an ip address (I would look the block up to see if it was me, but can't figure out how to get back to that page once I logged in). It had a welcome comment from you noting to sign talk pages and explaining how (thanks, by the way!) I headed over here to see what's up and see if I could figure out how to work the talk page system correctly (I don't think I've ever used it). Should I have edit summaries for talk page entries? Malician (talk) 15:59, 13 January 2008 (UTC)

Hello, Malician -
Got your msg, I've started this Talk page for you, where you can check messages, provided you're logged in with your Username.
Using edit summaries is strongly recommended on article edits, and most editors usually put a brief word or two in the edit summary for a Talk page message, too. One thing, make sure you sign all messages using 4 tildes like this: ~~~~. The Wikipedia software will then automatically include your username and timestamp when you Save page. I'd be happy to help with anything else, just let me know. Happy editing! JGHowes talk - 03:52, 14 January 2008 (UTC)

## Image:Michael Burns PhD.jpg

User:JGHowes, you want to delete this image as per WP deletion policy. This image was not scanned from a dust jacket cover. It was created and edited by me from an image that was on the internet not copyrighted. What kind of rationale needs to be placed on the image page that would save it from deletion? Just because you have noticed that the picture is the same as that on a dust jacket does not mean that it was generated in the same way.--Drboisclair (talk) 19:30, 14 January 2008 (UTC)

${\displaystyle \color {Red}\oplus }$You should add your explanation at the image deletion discussion here; although, generally speaking, images from an unknown website are also likely to be deleted due to uncertain copyright status. JGHowes talk - 20:10, 14 January 2008 (UTC)
What is a CV? I was unaware that it was from a dust jacket cover. If you must delete it, delete it.--Drboisclair (talk) 02:59, 15 January 2008 (UTC)
Sorry for using the cryptic acronym, "CV" is shorthand for copyright violation. Whoever took the original photo is the copyright holder, and only they can release it to the public domain or license its use on websites. A subsequent edit would be a "derivative" which is still subject to the same copyright restrictions.
As a non-free image, it could be used as Fair Use on Wikipedia, but only on an article about Burns' book, Dreyfus-a family affair (which Wikipedia doesn't have at present). A Fair Use image can't be used to illustrate a biography about a living person, however.JGHowes talk - 03:10, 15 January 2008 (UTC)

## dyk

 On 14 January, 2008, Did you know? was updated with a fact from the article Towson United Methodist Church, which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

--Archtransit (talk) 21:49, 14 January 2008 (UTC)

## An article which you started, or significantly expanded, Hampton National Historic Site, was selected for DYK!

 On January 15, 2008, Did you know? was updated with a fact from the article Hampton National Historic Site, which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

Thanks for your contributions! 06:20, 15 January 2008 (UTC)

• JGHowes, looks like I got credit for yours, and you got credit for mine. I did once go to Hampton NHS, and I must say, good job.--Bedford 14:51, 15 January 2008 (UTC)

## Re User warning to IP71.187.39.237

Hi Boris,

Just thought I'd drop by to say I agree with your reverting this anon. IP's edit to the John Wilkes Booth Lead. No question it was poorly worded and out of place. I was about to revert his edit myself when you beat me to it. The JWB article seems to attract a high level of vandalism and periodically we have to Semi-Protect it. But it seems to me that IP71.187.39.237 may have made a "good faith", if poorly done, edit. Assuming good faith (see assume good faith), a Level 4 Warning is a tad harsh, if it was a first time contributor (multiple users could be using that IP address, after all). My two cents ... JGHowes talk - 22:03, 15 January 2008 (UTC)

I disagree; the user was previously warned three times, level 1, level 2, level 3, so it is difficult to assume good faith after 3 warning to stop vandalizing. And as well, I'm quite familiar about the assuming good faith policy; I felt your comments at time talkpage a little too patronizing for my liking. Crazy Boris with a red beard (talk) —Preceding comment was added at 02:43, 16 January 2008 (UTC)

You're absolutely right, I went back and looked at IP71.187.39.237's other 3 recent edits and clearly it's a blatant vandal. The JWB edit, by itself, wasn't so obvious. Didn't mean to patronize at all, your Talk page header indicates you've only been on Wikipedia for a week, so I just assumed you were unfamiliar with this JGHowes talk - 05:21, 16 January 2008 (UTC)

## Image:Urner Goodman and Troop1.jpg

I like the image. I don't like the green circle. Can you get rid of the circle? Also, is Albert Hay Malotte in the photo? --evrik (talk) 15:23, 16 January 2008 (UTC)

• I think the problem can be solved by adding descriptors in the caption and in the image description. Thanks for listening. --evrik (talk) 15:48, 16 January 2008 (UTC)

## Image:BSA Natl Jamboree 1937.jpg

Thank you for the image, it's great and is really useful in several other articles! I appreciate the contribution! YiS, Chris (クリス) (talk) 03:29, 18 January 2008 (UTC)

Might you have any images relating to James P. Fitch? Chris (クリス) (talk) 05:18, 18 January 2008 (UTC)

## Bermuda Airport

Hi, I was just fiddling a bit with the airport page and I was wondering whether you'd agree to it being moved officially to L.F. Wade International Airport and having Bermuda International Airport and Bermuda Airport be the redirects. As far as I can tell this is now the "official" name of the airport (according to the airport's main page and various other sites) and not just a secondary name as it's put now. Regards, NcSchu(Talk) 17:40, 19 January 2008 (UTC)

Done. NcSchu(Talk) 18:24, 19 January 2008 (UTC)

## Bibliography

I don't know if you had noticed my Scouting bibliography; all of this is part of my personal collection. If you ever need a fact check from one of these, just let me know. --— Gadget850 (Ed) talk - 15:17, 20 January 2008 (UTC)

## New York Times

I created a template to simplify NYT cites {{nytquery}}. Let me know what you think. --— Gadget850 (Ed) talk - 20:50, 22 January 2008 (UTC)

## Spin and Marty

With your addition of the cover DVD image to the Spin and Marty article, would you say the black and white one is now superfluous? Or does it add to the reader's understanding, by virtue of being in black and white and the explanation about the introductory segment? I just wrote (or upgraded, I forget which) my FUR for the black and white one over the weekend, but I won't be crushed if only the color one is allowed to stand. What do you think? --Karen | Talk | contribs 05:36, 23 January 2008 (UTC)

Well, I'd prefer both for that reason, but I'm mentally preparing myself for someone's challenge of it. :) --Karen —Preceding unsigned comment added by Mavarin (talkcontribs) 07:46, 23 January 2008 (UTC)

## Crosley Field

If you have a minute, I wonder if you'd mind looking at my merger proposal. Thank you! Baseball Bugs What's up, Doc? 06:55, 23 January 2008 (UTC)

## Ogden Nash and Lou Gehrig

I like it. It assumes that Baseball Almanac has it right, of course. But it's a verifiable reference. And the format is fine. You might get somebody arguing about the colors or something like that. The "Z" entry could maybe be put at the Baseball Hall of Fame article, as it's a good summing up of the game's great players. If someone claims it's POV-pushing, tell them to go back to watching their soccer match. :) Baseball Bugs What's up, Doc? 16:50, 23 January 2008 (UTC)

You could always run it by the project page. Or you could just do it. I think whoever posted it originally already did it for a number of the articles. Baseball Bugs What's up, Doc? 16:54, 23 January 2008 (UTC)
Excellent work. Thank you! :) Baseball Bugs What's up, Doc? 15:21, 24 January 2008 (UTC)
I have to say, it's kind of interesting to see your contributions as you worked your way through the alphabetical list. I wonder what someone would guess you were up to, before they checked it out. (Yes, yes, a left-brain is a dangerous thing.) :) Baseball Bugs What's up, Doc? 18:42, 24 January 2008 (UTC)

The article claims he's a Baltimore fan, but I suspect that's a joke, as he was from New York and his poem has a strong New York flavor, such as wishing Frank Frisch were back with the Giants. Baseball Bugs What's up, Doc? 18:47, 24 January 2008 (UTC)

Well, I should read more carefully. Obviously, he liked Baltimore. But I stand by my suspicion that his boyhood teams and players, the ones he revered, focused on New York. Baseball Bugs What's up, Doc? 18:50, 24 January 2008 (UTC)

The Nash page could use some animal quotes. Here are some: [1] Baseball Bugs What's up, Doc? 18:52, 24 January 2008 (UTC)

This one has more animals. What I need to find is the list specifically connected with the Carnival of the Animals symphony. [2] Baseball Bugs What's up, Doc? 19:40, 24 January 2008 (UTC)
There's the one about the kangaroo, for example: [3] Baseball Bugs What's up, Doc? 19:42, 24 January 2008 (UTC)

## Whippoorwill.ogg

FYI, I found an error concerning Image:Whippoorwill.ogg that you might want to be aware of. My comments are summarized at Image_talk:Whippoorwill.ogg. I think the best thing to do would be to rename the file but I'll leave that up to you. The Crow (talk) 01:40, 24 January 2008 (UTC)

[from image file discussion] — Here are some links where you can hear and distinguish the difference:

Chuck-will's-widow
whippoorwill
list of birdsongs
• Thanks for informing me. I will rename the file and put it on the article for Chuck-will's-widow, Caprimulgus carolinensis. I take it you're quite familiar with the subject (I am not) and am wondering if you'd care to comment on the edit recently made to whippoorwill regarding the bird's "97% decline since 1983": this appears to be contradicted by its IUCN status of "Least concern". I looked at the reference given, and while whippoorwill populations may be declining in parts of Massachusetts, placing that in the article Lead may be giving it undue weight - your thoughts?JGHowes talk - 02:43, 24 January 2008 (UTC)
I'm just a backyard naturalist, I can't really comment on the studies. I have observed that in north Georgia we stopped hearing whippoorwills altogether in the mid-80's, and the chuck-will's became vanishingly rare in the 90's. But that's just anecdotal observation. The Crow (talk) 13:55, 24 January 2008 (UTC)

Fixed re-uploaded file as Image:Chuck-will's-widow birdcall.ogg and linked that file to the article Chuck-will's-widow. Have requested Speedy Delete of this now-orphaned file Image:Whippoorwill.ogg.

## Disputed fair use rationale for Image:Ed willard.jpg

Thanks for uploading Image:Ed willard.jpg. However, there is a concern that the rationale you have provided for using this image under "fair use" may be invalid. Please read the instructions at Wikipedia:Non-free content carefully, then go to the image description page and clarify why you think the image qualifies for fair use. Using one of the templates at Wikipedia:Fair use rationale guideline is an easy way to ensure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If it is determined that the image does not qualify under fair use, it will be deleted within a couple of days according to our criteria for speedy deletion. If you have any questions please ask them at the media copyright questions page. Thank you. Save-Me-Oprah (talk) 04:27, 25 January 2008 (UTC)

I sent Uncle Ed an email, Hopefully he'll have a picture to use in this article that can be released under GNU. Until then I'm not sure what the particulars are on the existing image. He knows his article is there and may even release this one I don't know.. --DP67 (talk/contribs) 10:23, 25 January 2008 (UTC)
FixedNon-free image now used only in article about the radio show/CD JGHowes talk - 06:35, 2 February 2008 (UTC)

## Your GA nomination of Towson United Methodist Church

The article Towson United Methodist Church you nominated as a good article has failed , see Talk:Towson United Methodist Church for reasons why the nomination failed. If or when these points have been taken care of, you may apply for a new nomination of said article. If you oppose this decision, you may ask for a reassessment. jackturner3 (talk) 21:11, 25 January 2008 (UTC)

## DYK

 On 27 January, 2008, Did you know? was updated with a fact from the article Anita Nall, which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

--Daniel Case (talk) 03:06, 27 January 2008 (UTC)

## Template:Non-free promotional discussion

Hello, JGHowes. Since you recently contributed to the lively deletion discussion for Template:Non-free promotional, I thought I'd let you know that I've continued the discussion about this template at Wikipedia talk:Non-free content#Template:Non-free promotional. The result of the deletion discussion was to keep the template, but there are still some questions about whether the current template serves a useful purpose and how to prevent its misapplication. Please contribute to the discussion if you are interested. —Bkell (talk) 17:54, 27 January 2008 (UTC)

## Images

See response to you image post on WP:SCOUT talk. RlevseTalk 19:02, 27 January 2008 (UTC)

## dyk

 On 29 January, 2008, Did you know? was updated with a fact from the article John Walker (organist), which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

--Victuallers (talk) 13:27, 29 January 2008 (UTC)

## First FA

Your first FA, congrats! RlevseTalk 01:49, 2 February 2008 (UTC)

## Ocean Grove

In the “Today” section of the current Ocean Grove article, it states:

“Beginning in the 1990s and continuing to the present, Ocean Grove has experienced a dramatic increase in property values.” This has not been the case since early last year. Anyone reading a newspaper is aware of real estate values declining. And they began declining in Ocean Grove around this time, also (as they did throughout much of NJ). Shouldn’t this be updated to reflect this?

In the same section it also states:

“There has been a considerable revival in the fortunes of the town, leading to a much less depressed community and the restoration of older hotel structures, many of which had deteriorated into Single Room Occupancy ("SRO") quarters.” Isn’t the phrase “a much less depressed community” opinion? I can find no article or reliable reference that makes or confirms that statement. It’s not in the article listed as a reference for the paragraph that follows this one on the Ocean Grove page (Michelle Sahn, "New life at old hotel site", Asbury Park Press, March 23, 2006). Therefore shouldn’t that statement be eliminated, as it’s opinion and not verifiable?

I would like to add the following to the site, but would like your opinion first:

To many “Grovers”, the destruction of the Ocean Grove Fishing Pier and boardwalk by the northeast winter storm of 1992, was devastating (Footnote to be added referencing A POINT OF PRIDE SWEPT OFF BY STORM - OCEAN GROVE LOST MORE THAN TIMBER. THE PIER WAS PART OF ITS LIFE. Source: William R. Macklin, Published December 14, 1992, Page S01, Philadelphia Inquirer, The (PA)) With the town's spirits at an all time low, late one night two friends, Carol and Bob, climbed a 20' high piling and erected a dummy of a fisherman. Named "Ralph", an acronym for Rising Above the Long Pier of Hope, he immediately became a local favorite as he smiled down at beachgoers, and helped buoy the town’s spirits. This was demonstrated later that summer, when his image was used on T-Shirts by The Ocean Grove Fishing Club to help raise funds to rebuild the town’s century old, landmark, fishing pier (photo of t-shirt to be included). When the pier was rebuilt the following year, Ralph was given a permanent perch upon which to sit...and to this day he can be seen sitting there (photo). As an indication of his inspiration and popularity, in 2002, ten years after he was erected, the Ocean Grove Camp Meeting Association honored Ralph by making him the first fictional character to ever appear on the town’s summer beach badge (photo of beach badge to be included). Bilbobag (talk) 15:50, 5 February 2008 (UTC)

## Ocean Grove Auditorium Flag

The "undulating" flag referenced in the article was replaced about 4 years ago. I'll try to get the exact date. The flag shown in the phot of the auditorium (2007) is the new flag. This flag lights, but not in the undulating manner of the old one. Bilbobag (talk) 15:49, 5 February 2008 (UTC)

## PCH page

Thanks for cleaning up the Publishers Clearing House entries. See...I do try do use references :) Bilbobag (talk) 23:36, 5 February 2008 (UTC)

## Ocean Grove Record

Hi JGH,

This was the entire content of the article when I deleted it:

The Ocean grove Record is an online newspaper serving Ocean Grove and Neptune NJ since 2004. A link to the paper is attached :

Ocean Grove Record website and homepage

Obviously, I'm not opposed to someone reposting an article with more content. NawlinWiki (talk) 13:08, 7 February 2008 (UTC)

## Talk:Rough collie.

I've reverted to the revision you linked. · AndonicO Hail! 18:56, 8 February 2008 (UTC)

## FDR

Good Scouting addition to FDR article, but it's deterioated over time. The refs need some work, it would not pass a FAC today. Sumoeagle179 (talk) 13:40, 9 February 2008 (UTC)

## Letter

You have a letter from Goodman for that photo? Any more input on Hillcourt article? RlevseTalk 03:46, 10 February 2008 (UTC)

yes, EUG sent me a letter back in 1975 when I asked for a photo for a newspaper column I was writing as well as our OA Lodge newsletter. Seems to me I've seen a pix of Green Bar Bill with an OA sash, I'm still looking but moving very slowly due to being down with the flu since Tues. JGHowes talk - 03:59, 10 February 2008 (UTC)

Obviously you do not watch 30 Rock or you would know that that in the 30 Rock universe, NBC is owned by the Sheinhardt Wig Company. It is an "official" logo. Accusing people of being vandals when you are obviously one is wrong! Also We Brief (talk) 14:19, 10 February 2008 (UTC)

Note: User:Also We Brief was subsequently blocked indef as a SSP

## Stop harassing me!

Stop harassing me. This is your one and only warning! Also We Brief (talk) 19:11, 10 February 2008 (UTC)

## Re:Image

I left the user a message saying he is allowed to remove comments from his talk page (it shows he has read/understood them), but told the user not to call them vandalism.   jj137 (talk) 19:44, 10 February 2008 (UTC)

They don't have to, but I would say it's a good idea.   jj137 (talk) 20:08, 10 February 2008 (UTC)

## Your GA nomination of Towson United Methodist Church

Hello, I just wanted to introduce myself and let you know I am glad to be reviewing the article Towson United Methodist Church you nominated for GA-status according to the criteria. This process may take up to 7 days. Feel free to contact me with any questions or comments you might have during this period. jackturner3 (talk) 15:20, 14 February 2008 (UTC)

## Triple crown

It gives me great pleasure to award this triple crown to JGHowes in thanks for superb content contributions to Wikipedia. DurovaCharge! 01:53, 15 February 2008 (UTC)

Your Majesty, could I have a ride in the Cessna? ;) DurovaCharge! 01:53, 15 February 2008 (UTC)

## FUR tags

What's the purpose of these inline commented out FUR stmts you added to Hillcourt? I've not seen this before. All one has to do is click on the image to see its status. RlevseTalk 00:37, 19 February 2008 (UTC)

I read somewhere that this should be done (perhaps as a legal notice for mirror sites?) but at the moment I can't find the specific reference. I've always included it, e.g., Fair Use images at EUG. I'm still looking... JGHowes talk - 00:50, 19 February 2008 (UTC)

## Bold: incipit and 1st headline

I delayed the bold from the first section, but you can leave the bold in the incipit. Graphic questions ;-) MOJSKA 666 (msg) 18:22, 29 February 2008 (UTC)

## Roman Catholic Church

Hi JG, thanks for your comment on the FAC page. I think I have addressed your comment by using one of the blockquote templates. I would like to know if my edit addressed your concerns or not. Can you please see the page again and let me know if it is still unsatisfactory? Thanks. NancyHeise (talk) 23:44, 1 March 2008 (UTC)

## Orphaned non-free media (Image:Babe Ruth Story (1948 movie).jpg)

Thanks for uploading Image:Babe Ruth Story (1948 movie).jpg. The media description page currently specifies that it is non-free and may only be used on Wikipedia under a claim of fair use. However, it is currently orphaned, meaning that it is not used in any articles on Wikipedia. If the media was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that media for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that all non-free media not used in any articles will be deleted after seven days, as described on criteria for speedy deletion. Thank you. BJBot (talk) 19:52, 6 March 2008 (UTC)

Fixed, instance of vandalism in article where image is used JGHowes talk - 20:24, 6 March 2008 (UTC)

## Roman Catholic Church

There is a revote on the FA leave comments page of this article. You are invited to reexamine the article and either confirm or deny your previous support vote by voting again. Thanks. NancyHeise (talk) 08:16, 13 March 2008 (UTC)

## Order of the Arrow

You were recently involved in discussions on the article Order of the Arrow. Some of the issues brought up then were not resolved. If you are interested, please participate in the continued discussion at Talk:Order of the Arrow#Safeguarded material. --— Gadget850 (Ed) talk - 13:52, 17 March 2008 (UTC)

## Triple crown request

Hi, thanks for requesting the imperial triple crown jewels. Unfortunately there's been a slight problem you might not have been aware of: my assistant and I count 3 citations you added to William Hillcourt; the published minimum for purposes of triple crown consideration is 10 inline citations. If that's a miscount I'll be happy to review diffs. Otherwise I'll look forward to seeing you soon when you get your next piece of featured content. Thanks very much for applying, and keep up the good editing. DurovaCharge! 17:50, 18 March 2008 (UTC)

## Bio guideline question

I don't know of any particular guideline that covers this, but I wouldn't be surprised if some sort of rules for these situations existed. In my experiences, I have written the old name and placed the new name in parentheses. I don't participate on the WikiProject Biography talk page, so I wouldn't know if any discussion on the matter has taken place. Nishkid64 (Make articles, not love) 20:22, 19 March 2008 (UTC)

## Jim Bakker edit

Hi, I have attempted to add some color as well as quotes from Jim Bakker both before, during and after the HeritageUSA scandals in the 1980's. These are from personal observations at the time as well as interviews conducted with Bakker and his wife and his aides. The content can be sourced at TIME magazine's articles at the time, with the byline of religion writer Dick Ostling. Regards, MarmadukePercy (talk) 20:58, 21 March 2008 (UTC)

Thanks for clarifying the wikipedia policy. I've added a bit to Dick Ostling's page to take account of his work on the Jim & Tammy stories. See the accompanying footnote "Letter from the Publisher."MarmadukePercy (talk) 23:12, 21 March 2008 (UTC)

## Aviation Project Group

Please consider joining the Aviation Project Group. I undid a recent edit of yours on an aviation topic because this group has established some unique guidelines including formatting and use of words, dates and measures. FWIW Bzuk (talk) 21:09, 24 March 2008 (UTC).

JGHowes, thanks for writing. After considerable debate on discussion pages, a consensus-driven decision was made to establish a consistent dating across aviation articles. The accepted standard now for aviation articles is to have all dates appear as 17 August 2007. This practice has arisen because a number of foreign users had difficulty with reading the other ISO standard 08-17-07 or 17-08-07 formats (which one prevailed in their country?) as well the standard now for academic writing has been established for date, month, year, therefore the "formal" format became a written out date. Unlike some U.S. readers considering the month, date, year as a U.S. standard, it is also used in many other parts of the world and is sometime known as the "popular" style." The use of the new date format also allows for readers who have date preferences established in their browser to read the date in the style that they prefer. It is also a recommended standard in Wiki:Project Aviation because the vast majority of Wikipedia users do not have browser preferences set. As well, having a consistent style of date formating is merely standard practice. I know it amounts to a lot of repetitive editing but I only do it on articles wherein I make a substantial contribution. Thanks again for your note. FWIW Bzuk (talk) 21:50, 24 March 2008 (UTC).

## Twinkle

You may be interested in WP:TW, a really great set of anti-vandalism and maintenance tools. You can enable Twinkle from Special:Preferences > Gadgets. --— Gadget850 (Ed) talk - 13:08, 28 March 2008 (UTC)

Yes, Ed, I'm aware of Twinkle, but I can't use it because my browser is IE. I do use WP:ROLLBACK when possible, but for multiple/complex vandalism the old "Undo" is necessary JGHowes talk - 01:43, 29 March 2008 (UTC)

## DYK

Hi. I've nominated Washingtonian (B&O), an article you worked on, for consideration to appear on the Main Page as part of Wikipedia:Did you know. You can see the hook for the article at Template talk:Did you know#Articles created/expanded on March 30, where you can improve it if you see fit. --Dtbohrertalkcontribs 03:58, 31 March 2008 (UTC)

## Image:Bundjalungwelcome.jpg

Thanks for retouching it, but the picture is still s***, and isn't Wikipedia-standard IMHO. Peter1968 (talk) 21:50, 6 April 2008 (UTC)

## DYK again

 On 7 April, 2008, Did you know? was updated with a fact from the article KILI-FM, which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

- Thanks for your contributions! - Deacon of Pndapetzim (Talk) 14:48, 7 April 2008 (UTC)

BetacommandBot (talk) 23:57, 7 April 2008 (UTC)

## Imperial triple crown jewels

Your majesty, it gives me great pleasure to bestow these Imperial triple crown jewels upon JGHowes for your contributions in the areas of WP:DYK, WP:GA, and WP:FA. Cirt (talk) 11:28, 8 April 2008 (UTC)

Thank you for contributions to the project, Great work, especially on Royal Blue (B&O train), nice work, quite a comprehensive article. May you wear the crowns well. Cirt (talk) 11:28, 8 April 2008 (UTC)

Hey, no prob, you deserve it. Cirt (talk) 14:42, 11 April 2008 (UTC)

## Brown Memorial Presbyterian Church

Congratulations on obtaining GA status for the article you nominated, and into which you obviously put a lot of effort. Thank you for all your hard work. StAnselm (talk) 22:57, 8 April 2008 (UTC)

## Template:Infobox church/sandbox: Colour-coding system

Hi, JG. Following discussions with other editors, I've worked out a colour-coding system that will cause the template to automatically display certain background colours depending on which denomination a church belongs to: see "Template talk:Infobox church#Actual and proposed updates" (and let's continue the conversation there). Your input on the colours I've chosen so far are most welcome. — Cheers, JackLee talk 17:43, 9 April 2008 (UTC)

## Re: New York Times archives

Since late September, all New York Times articles since 1987 have been freely accessible. There are two ways I do it: either I search for the article title in quotes with Google (which will usually bring up the free version of the article), or If I don't know the article title, I change search/restricted/article" in the URL to "gst/abstract.html", press enter, and the URL is automatically converted to the new format if a free version of the article can be found. Graham87 01:09, 10 April 2008 (UTC)

## re: Focus on the Family CV

Diligent research on finding the contribution edit. And thanks for issuing a warning. I myself did a bit of research into the anon. Ends up the IP resolves to "The DeMoss Group", a Christian, faith-based public relations firm. And I bet you can't guess who one of there clients is? (here is a hint: [4]) If their client indeed intended to release their content under the GFDL, then they should state so explicitly on their website or file an OTRS report here with Wikipedia. Until then, we'll have to assume that this was a copyvio (even if it was in good "faith", excuse the pun). -Andrew c [talk] 22:29, 11 April 2008 (UTC)

## Speedy deletion of Image:Garrett Farm.gif

A tag has been placed on Image:Garrett Farm.gif requesting that it be speedily deleted from Wikipedia. This has been done under section I8 of the criteria for speedy deletion, because it is available as a bit-for-bit identical copy on the Wikimedia Commons under the same name, or all references to the image on Wikipedia have been updated to point to the title used at Commons.

If you think that this notice was placed here in error, you may contest the deletion by adding {{hangon}} to the top of the page (just below the existing speedy deletion or "db" tag), coupled with adding a note on [[ Talk:Image:Garrett Farm.gif|the talk page]] explaining your position, but be aware that once tagged for speedy deletion, if the article meets the criterion it may be deleted without delay. Please do not remove the speedy deletion tag yourself, but don't hesitate to add information to the article that would would render it more in conformance with Wikipedia's policies and guidelines. Lastly, please note that if the article does get deleted, you can contact one of these admins to request that a copy be emailed to you. Sdrtirs (talk) 02:54, 13 April 2008 (UTC)

## Orphaned non-free image (Image:Lou Gehrig HoF.jpg)

Thanks for uploading Image:Lou Gehrig HoF.jpg. The image description page currently specifies that the image is non-free and may only be used on Wikipedia under a claim of fair use. However, the image is currently orphaned, meaning that it is not used in any articles on Wikipedia. If the image was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that images for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that any non-free images not used in any articles will be deleted after seven days, as described on criteria for speedy deletion. Thank you. Do you want to opt out of receiving this notice? Milk’s Favorite Cookie (Talk) 23:11, 17 April 2008 (UTC)

Please see WP:NFCC criteria # 1. Milk’s Favorite Cookie (Talk) 23:34, 17 April 2008 (UTC)
And your point is? If there's a free image portrait of Lou Gehrig in his Yankee playing days suitable for the Infobox, where is it? I've been looking ever since I started contributing to that article a year ago, and have yet to find one. JGHowes talk - 00:34, 18 April 2008 (UTC)
This would work well.... Milk’s Favorite Cookie (Talk) 01:39, 18 April 2008 (UTC)
I don't think much of that one. It's not really identifiable as Gehrig, IMO. JGHowes talk - 16:57, 18 April 2008 (UTC)

## Disputed fair use rationale for Image:AGO logo.png}

Thank you for uploading Image:AGO logo.png. However, there is a concern that the rationale provided for using this image under "fair use" may not meet the criteria required by Wikipedia:Non-free content. This can be corrected by going to the image description page and add or clarify the reason why the image qualifies for fair use. In particular, for each page the image is used on, the image must have an explanation linking to that page which explains why it needs to be used on that page. Can you please check:

• That there is a non-free use rationale on the image's escription page for each article the image is used in.
• That every article it is used on is linked to from its description page.

Please be aware that a fair use rationale is not the same as an image copyright tag; descriptions for images used under the fair use policy require both a copyright tag and a fair use rationale.

If it is determined that the image does not qualify under fair use, it might be deleted by adminstrator within a few days in accordance with our criteria for speedy deletion. If you have any questions, please ask them at the media copyright questions page. Thank you. NOTE: once you correct this, please remove the tag from the image's page. STBotI (talk) 18:36, 21 April 2008 (UTC)

Fixed - put NFUR in template format JGHowes talk - 20:04, 21 April 2008 (UTC)

## Image:Rawhide.jpg

I have tagged Image:Rawhide.jpg as {{orphaned fairuse}}. In order for the image to be kept at Wikipedia, it must be included in at least one article. If this image is being used as a link target instead of displayed inline, please add {{not orphan}} to the image description page to prevent it being accidentally marked as orphaned again. Melesse (talk) 06:17, 22 April 2008 (UTC)

Fixed, article created — Rawhide (1938 film) JGHowes talk - 06:26, 22 April 2008 (UTC)

## Re: Camden Yards station

Actually, considering the precedents that we have on other articles where the subject changed names (Electro-Motive Diesel comes to mind as the closest analogy), I'm more inclined to think it should be at "Camden Yards". However, since that location is currently a redirect to the ballpark, it seems to me that the current title is best and the redirect should be changed to a disambig page, but since I'm not in Baltimore, I wouldn't necessarily know which is the more prominent usage of the name. Slambo (Speak) 17:50, 24 April 2008 (UTC)

## Lou Gehrig

After looking, it seems you are correct regarding the vets committee, but the writers didn't vote on him either (at least according to the HOF website), so "unanimous" isn't really accurate either. Any thoughts on what would be more accurate? "Special election" maybe? Thanks. - Masonpatriot (talk) 20:27, 27 April 2008 (UTC)

## RE:Theodore Epp rating

Im sorry. I have removed the no-infobox and image tag. But I think it is still a stub.

KillerGorillaV (Talk) 03:29, 29 April 2008 (UTC)

## WP:X Assessment

Please see my reply here - Tinucherian (talk) 04:27, 29 April 2008 (UTC)
Many thanks for your quick response on this cumbersome task. JGHowes talk - 05:06, 29 April 2008 (UTC)

## GA review for Baltimore Steam Packet Company

I've reviewed the article Baltimore Steam Packet Company for its GA nomination. There are some prose issues and one image issue that should be able to be addressed within seven days, so I have placed it on hold for now. — Bellhalla (talk) 16:35, 4 May 2008 (UTC)

The prose fixes all look good so I've updated the GA review. Let me know when you get the image issue completely resolved, and I'll be happy to promote the article. — Bellhalla (talk) 15:49, 5 May 2008 (UTC)

## 5/4 DYK

 On 4 May, 2008, Did you know? was updated with a fact from the article Baltimore Steam Packet Company , which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

--Bedford 20:14, 4 May 2008 (UTC)

## Lucille Ball

Can you please explain to me why you unarchived the Lucille Ball talk page? I see no real reason that it has been unarchived. Please explain. Thank you Canyouhearmenow 03:38, 6 May 2008 (UTC)

I can fully understand that, however, the part of the talk page that you unarchived was talk that went on while I was trying to get it to GAstatus. I just don't see a reason or rhyme as to why it would be something that would need to be unarchived. There is no current conversation going one with those topics and the article has now gone GA. I guess I am just unclear as to why they need to be opened? Canyouhearmenow 03:59, 6 May 2008 (UTC)
Thanks bud, I just want to kind of keep it clean looking. I really want to start moving it towards FA status when I come back off my little break. Thanks for your help. I had the page protected because of IP vandalism. I did not realize that the semi block had expired! I will have to watch it now. Thanks again Canyouhearmenow 04:13, 6 May 2008 (UTC)
Hi, I do not understand why the Lucille Ball talk page needs to be archived. Just because YOU chose to archive it, there is not necessarily a consensus. 151.203.250.9 (talk) 21:12, 6 May 2008 (UTC)
The old msgs were just archived, not deleted, by another editor with agreement of 2 others JGHowes talk - 11:15, 17 May 2008 (UTC)

## Image copyright problem with Image:AltPressMagCover.jpg

Thanks for uploading Image:AltPressMagCover.jpg. You've indicated that the image is being used under a claim of fair use, but you have not provided an adequate explanation for why it meets Wikipedia's requirements for such images. In particular, for each page the image is used on, the image must have an explanation linking to that page which explains why it needs to be used on that page. Can you please check

• That there is a non-free use rationale on the image's escription page for each article the image is used in.
• That every article it is used on is linked to from its description page.

This is an automated notice by FairuseBot. For assistance on the image use policy, see Wikipedia:Media copyright questions. --09:45, 9 May 2008 (UTC)

Fixed FUR tag/link added JGHowes talk - 15:37, 16 May 2008 (UTC)

## Orphaned non-free media (Image:KPIE airport logo.png)

Thanks for uploading Image:KPIE airport logo.png. The media description page currently specifies that it is non-free and may only be used on Wikipedia under a claim of fair use. However, it is currently orphaned, meaning that it is not used in any articles on Wikipedia. If the media was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that media for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that all non-free media not used in any articles will be deleted after seven days, as described on criteria for speedy deletion. Thank you. BJBot (talk) 12:16, 15 May 2008 (UTC)

## FieldTurf

Hey JG, You've recently warned Jayjaysmo about deleting content from the FieldTurf article without stating a reason so I thought I'd let you know he has struck again. 24.211.155.222 (talk) 23:08, 15 May 2008 (UTC)
Another warning sent to him. If he repeats, he will be blocked. JGHowes talk - 15:42, 16 May 2008 (UTC)

I think you posted a message on my user talk page that was intended for someone else by accident. It says not to delete stuff from other user's talk pages, but I don't think I've done that. Take a look when you can. 24.211.155.222 (talk) 10:31, 17 May 2008 (UTC)
Resolved
msg sent in error JGHowes talk - 11:15, 17 May 2008 (UTC)

## Tagging

Hi,

I tagged these because I used the CommonsHelper to migrate them there, for some reason it did it but they didn't show up..? Thanks --92.10.88.48 (talk) 20:35, 17 May 2008 (UTC)

## Re. Warning to new user JLE1021

Hello JGHowes and thank you for reporting this to me. I had automatically reverted this user after he blanked an article, but after checking his recent history I see that he did that in good faith. I have removed the warning I had left on his talk page. Thank you. Regards, Húsönd 15:58, 21 May 2008 (UTC)

## JP Cultural refs

Hi just moved the project tags at the main art across to cultural refs - they may need changing in that new art - cheers SatuSuro 00:43, 23 May 2008 (UTC)

## Picture of Catherine Zeta-Jones

Are you sure that it's Catherine Zeta-Jones and not Jill Hennessy ? J-L Cavey (from fr.wikipedia.org) 81.65.193.78 (talk) 16:51, 24 May 2008 (UTC)

Yes, of course. I'm with her in the original picture at an event she attended in Bermuda with Michael Douglas (I cropped myself out for the Wikipedia upload). JGHowes talk - 16:54, 24 May 2008 (UTC)

## Lizard.

I simply moved the iamge down below. A photo of a live lizard it better for the textbox. The diversity of lizardscan be placedsomewhere else. Plus the numerous photos of different lizards already so the diversity. 69.29.254.57 (talk) 21:23, 25 May 2008 (UTC)

## Re:Wawelberg Group

Per WP:SNOW, it is already clear that the merge proposal lacks support.-- 11:04, 26 May 2008 (UTC)

## Marylander (B&O train)

 On 27 May, 2008, Did you know? was updated with a fact from the article Marylander (B&O train), which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

--BorgQueen (talk) 13:16, 27 May 2008 (UTC)

## Orphaned non-free media (Image:Lou Gehrig stamp.png)

Thanks for uploading Image:Lou Gehrig stamp.png. The media description page currently specifies that it is non-free and may only be used on Wikipedia under a claim of fair use. However, it is currently orphaned, meaning that it is not used in any articles on Wikipedia. If the media was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that media for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that all non-free media not used in any articles will be deleted after seven days, as described on criteria for speedy deletion. Thank you. BJBot (talk) 08:39, 2 June 2008 (UTC)

Fixed image restored to article JGHowes talk - 14:36, 2 June 2008 (UTC)

## DYK

 On 2 June, 2008, Did you know? was updated with a fact from the article James H. Howard, which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

--Maxim(talk) 23:10, 2 June 2008 (UTC)

## Barnhouse image

I asked for input on the fair-use rationale for Image:Donald G Barnhouse.jpg. You may want to add your two cents. (Nothing personal, you understand. I'd like to have an image in there, if possible.) --Flex (talk/contribs) 14:34, 3 June 2008 (UTC)

## Nice article

Nice Maryland and Pennsylvania Railroad article.

Smallbones (talk) 03:37, 4 June 2008 (UTC)

 On 4 June, 2008, Did you know? was updated with a fact from the article Maryland and Pennsylvania Railroad, which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

--BorgQueen (talk) 18:58, 4 June 2008 (UTC)

## Catholic Encyclopedia of 1913

Hi, you just removed information from Benedictus (Song of Zechariah) on the grounds that it was a copyvio -- but it was taken from the Catholic Encyclopedia of 1913 which is in the public domain. You can see the original here at Wikisource. This is explained on the face of the article in the References section.

I propose to restore the material, but perhaps you would like to do so, to avoid the appearance of edit warring. - Fayenatic (talk) 12:09, 10 June 2008 (UTC)

Resolved: see article talk for reply

## DYK

 On 11 June, 2008, Did you know? was updated with a fact from the article Robert W. Peterson (writer), which you created or substantially expanded. If you know of another interesting fact from a recently created article, then please suggest it on the Did you know? talk page.

--Royalbroil 05:02, 11 June 2008 (UTC)

## Terry Sanford

I've put a lot of work into this article lately and hope to nominate it for FAC in a couple of days. If you could look it over and give it a good copyedit, etc, I'd really appreciate it. RlevseTalk 00:51, 14 June 2008 (UTC)


text:
Univerza na Primorskem Fakulteta za matematiko, naravoslovje in informacijske tehnologije
SI | EN

# Raziskovalni matematični seminar - Arhiv

 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010
 1 2 3 4 5 6 7 8 9 10 11 12
Datum in ura / Date and time: 27.7.21
(17:00 -- 18:00)
Predavalnica / Location: Zoom
Predavatelj / Lecturer: Sarobidy Razafimahatratra (University of Regina, Canada)
Naslov / Title: The Erdos-Ko-Rado theorem for transitive groups
Vsebina / Abstract:

A set of permutations $\mathcal{F}$ of a finite transitive group $G\leq \sym(\Omega)$ is \emph{intersecting} if any two permutations in $\mathcal{F}$ agree on an element of $\Omega$. The transitive group $G$ is said to have the \emph{Erd\H{o}s-Ko-Rado (EKR) property} if any intersecting set of $G$ has size at most $\frac{|G|}{|\Omega|}$.

The alternating group $Alt(4)$ acting on the six $2$-subsets of $\{1,2,3,4\}$ is an example of groups without the EKR property. Hence, transitive groups need not have the EKR property.    Given a transitive group $G\leq \sym(\Omega)$, we are interested in finding the size and structure of the largest intersecting sets in $G$. In this talk, we will give an overview of the EKR-theory for transitive groups and present some recent development in this area.

Join Zoom meeting here:

https://upr-si.zoom.us/j/86104965231?pwd=SFZoMWFpbTN4SmtCMXc1OVVQQmVEQT09

We are looking forward to meeting at the video conference.

See you there!

Datum in ura / Date and time: 26.7.21
(11:00 -- 12:00)
Predavalnica / Location: Zoom
Predavatelj / Lecturer: Milad Ahanjideh (Bogazici University, Turkey )
Naslov / Title: On intersecting sets of groups
Vsebina / Abstract:

Let $\Omega$ be a finite set and $G$ be a permutation group on it.

A subset $A$ of $G$ is \textit{intersecting} if for every $\delta,~\tau \in A$, they agree at some points, i.e. there exists $x \in \Omega$ such that $\delta(x)=\tau(x)$.

In this talk, I will give an analog of the classical Erd\H{o}s–Ko–Rado theorem for intersecting sets of a group.  I will present a history and overview of some of the results that have been proved on this subject. Finally,  I will discuss some of my results about intersecting sets of the general linear group and its subgroups.

Join Zoom meeting here:

https://upr-si.zoom.us/j/83882798074?pwd=VTdlLzVmRExBWGdwY1pTZFAvUkZMdz09

Datum in ura / Date and time: 17.6.21
(10:00 -- 11:00)
Predavalnica / Location: FAMNIT-VP1 & ZOOM
Predavatelj / Lecturer: Besfort Shala
Naslov / Title: The Probabilistic Zeta Function of a Finite Lattice
Vsebina / Abstract:

Let G be a finite group and let P(G, s) be the probability that an s-tuple of elements in G generate G. Due to Hall, there is a finite Dirichlet series expression for P(G, s), obtained by using the principle of Möbius inversion on partially ordered sets. Brown defined an analogous function P(L, s) for finite lattices, ultimately showing that P(C(G), s+1) = P(G, s), where C(G) is the coset lattice of the group G, that is, P(G, s) only depends on the coset lattice of G.

In this talk, we present our work as part of the "Final Project Paper" course, mentored by dr. Russ Woodroofe. We study Brown's definition of P(L, s), as well as propose a natural alternative that may be better-suited for non-atomic lattices. In this case, we obtain a general Dirichlet series expression for P(L, s), which need not be an ordinary Dirichlet series. We investigate general properties of P(L, s) and compute it on several examples of finite lattices, establishing connections with well-known identities. Furthermore, we investigate when P(L, s) is an ordinary Dirichlet series. Since P(C(G), s) is always such, we call such lattices coset-like. In this regard, we focus on partition lattices and 2-divisible partition lattices and show that they generally fail to be coset-like.

Join Zoom Meeting Here!

Datum in ura / Date and time: 31.5.21
(10:00 -- 11:00)
Predavalnica / Location: Zoom
Predavatelj / Lecturer: Michael Vyalyi (HSE University , Russia)
Naslov / Title: Re-pairing brackets
Vsebina / Abstract:

The re-pairing problem is a recently discovered combinatorial problem concerning Dyck words. We have first identified the re-pairing problem when studying an open question in automata theory, the complexity of translation of one-counter automata (OCA) on finite words into Parikh-equivalent nondeterministic finite automata (NFA). But it appears that the re-pairing problem has natural connections with other combinatorial problems arising in analysis of weak models of computation (e.g., black-and-white pebble games). We hope that more relations will be discovered in future.

In the talk I will define the problem and give a survey of known results about it.

This is joint work with D. Chistikov.

Join Zoom Meeting Here!

Datum in ura / Date and time: 24.5.21
(10:00 -- 11:00)
Predavalnica / Location: Zoom
Predavatelj / Lecturer: Matjaž Krnc (UP FAMNIT, Slovenia)
Naslov / Title: Shifting any path to an avoidable one
Vsebina / Abstract:

A vertex $v$ in a graph $G$ is avoidable if every induced path on three vertices with middle vertex $v$ is contained in an induced cycle. Dirac's classical result from 1961 on the existence of simplicial vertices in chordal graphs is equivalent to the statement that every chordal graph has an avoidable vertex. Beisegel, Chudovsky, Gurvich, Milani\v{c}, and Servatius (2019) generalized the notion of avoidable vertices to \emph{avoidable paths}, and conjectured that every graph that contains an induced $k$-vertex path also contains an avoidable induced $k$-vertex path; they proved the result for $k = 2$. The case $k = 1$ was known much earlier, due to a work of Ohtsuki, Cheung, and Fujisawa in 1976. The conjecture was proved for all $k$ in 2020 by Bonamy, Defrain, Hatzel, and Thiebaut. This result generalizes the mentioned results regarding avoidable vertices, as well as a result by Chv\'atal, Rusu, and Sritharan (2002) suggested by West on the existence of simplicial $k$-vertex paths in graphs excluding induced cycles of length at least  $k+3$.

In this talk we discuss an adaptation of the approach by Bonamy et al.~from a reconfiguration point of view. We say that two induced $k$-vertex paths are \emph{shifts} of each other if their union is an induced path with $k+1$ vertices and show that in every graph, every induced path can be shifted to an avoidable one. We also present an analogous result about paths that are not necessarily induced, where an efficient reconfiguration sequence relies on the properties of depth-first search trees.

Join Zoom Meeting Here!

Datum in ura / Date and time: 17.5.21
(10:00 -- 11:00)
Predavalnica / Location: Zoom
Predavatelj / Lecturer: Blas Fernández (UP IAM, Slovenia)
Naslov / Title: On 2-Y-homogeneous and almost 2-Y-homogeneos distance-biregular graphs
Vsebina / Abstract:

Let G denote a distance-biregular graph with bipartite parts Y and Y’. Let D denote the eccentricity of vertices in Y. Given a vertex z, let \Gamma_i(z) denote the set of all vertices which are at distance i from z. For vertices x and y, let \Gamma_{i,j}(x,y) denote the collection of all vertices which are at distance i from x and at distance j from y.

In this talk, we will show necessary and sufficient conditions on the intersection array of G for which the given graph has one of the following two combinatorial structures:

1. for all i (1 \leq i \leq D-2) and for all x\in Y, y\in \G_2(x) and z \in \G_{i,i}(x,y) the number of vertices in \G_{1,1}(x,y) which are at distance i-1 from z is independent of the choice of x,y and z.

2. for all i (1 \leq i \leq D-1) and for all x\in Y, y\in \G_2(x) and z \in \G_{i,i}(x,y) the number of vertices in \G_{1,1}(x,y) which are at distance i-1 from z is independent of the choice of x,y and z.

Distance-biregular graphs with the previous combinatorial structures are called almost 2-Y-homogeneous and 2-Y-homogeneous, respectively. Several examples will also be presented. This is joint work with Safet Penjić.

Join Zoom Meeting HERE!

Everyone is welcome and encouraged to attend.

Datum in ura / Date and time: 10.5.21
(10:00 -- 11:00)
Predavalnica / Location: Zoom
Predavatelj / Lecturer: Slobodan Filipovski (UP FAMNIT)
Naslov / Title: On the clique number and Mantel/Turan theorems
Vsebina / Abstract:

Let G=(V,E) be a finite undirected graph with vertex set V(G) of order |V(G)|=n and edge set E(G) of size |E(G)|=m. Let d_{1}\geq d_{2}\geq...\geq d_{n} be the degree sequence of the graph G.

A clique in a graph G is a complete subgraph of G.  A clique is called maximum if it has maximum cardinality.
The clique number of a graph G, denoted \omega(G), is the order of a maximum clique of G.

In 1907 Mantel proved that a triangle-free graph with n vertices can contain at most  $lfloor \frac{n^{2}}{4}\rfloor edges. In 1941 Tur\' an generalized Mantel's result to graphs not containing cliques of size r by proving that graphs of order n that contain no induced K_{r} have at most (1-\frac{1}{r-1}) \frac{n^{2}}{2} edges. In this talk, we present new lower bounds for the clique number \omega(G). Moreover, we obtain a new bound for the maximum number of edges in a K_{r}-free graph G of order n, with minimum degree d_{n}, and maximum degree d_{1}. The results are based on elementary inequalities applied to the degree sequence d_{1}\geq d_{2}\geq\ldots \geq d_{n}. We are looking forward to meeting at the video conference. Join Zoom Meeting HERE! Datum in ura / Date and time: 3.5.21 (10:00 -- 11:00) Predavalnica / Location: Zoom Predavatelj / Lecturer: Tomaž Pisanski (UP FAMNIT and UL FMF). Naslov / Title: Embeddings of Action Graphs Vsebina / Abstract: In the literature, one can find at least three different genus parameters associated with a finite group: genus, symmetric genus, and strong symmetric genus. While the genus of a group is defined in terms of the (undirected, non-edge-colored) Cayley graphs, plain graphs are not adequate for modeling symmetric and strongly symmetric embeddings and thus cannot be used directly for determining the symmetric and strong symmetric genus of a group. We propose (generalized) action graphs to model such embeddings. Although action graphs are a wider class of edge-colored, partially directed graphs than Cayley color (di)graphs, the idea of symmetric and strongly symmetric embedding can be applied to them. In addition, we present some applications of action graphs. This is joint work with Thomas W. Tucker. We are looking forward to meeting at the video-conference. Join Zoom Meeting HERE! For more info visit our YouTube Channel. Datum in ura / Date and time: 19.4.21 (10:00 -- 11:00) Predavalnica / Location: Zoom Predavatelj / Lecturer: Mikhael Muzychuk (Ben-Gurion University of the Negev, Israel) Naslov / Title: On Jordan Schemes Vsebina / Abstract: Motivated by the problems appearing in the theory of experimental designs, Bose and Mesner introduced in 1959 a special class of matrix algebras, known nowadays as Bose-Mesner algebras of symmetric association schemes. In the same year, Shah published the paper where he proposed a more general idea: to replace the standard matrix product with the Jordan product. So, in fact, he introduced the objects called later Jordan schemes by Cameron. While the ideas of Bose and Mesner led to a new direction in algebraic graph theory called later algebraic combinatorics by Bannai and Ito, Shah's idea was not developed at all. Only in 2004 Shah's approach was analyzed by Bailey. She observed that the symmetrization of any association scheme is a Jordan scheme, which led to the following question posed by Cameron: "Are there any others?". In my talk, I'm going to present some constructions of Jordan schemes that provide an affirmative answer to Cameron's question. This is joint work with M. Klin and Sven Reichard. We are looking forward to meeting at the video-conference. Join Zoom Meeting HERE! For more info visit our YouTube Channel. Datum in ura / Date and time: 12.4.21 (10:00 -- 11:00) Predavalnica / Location: Zoom Predavatelj / Lecturer: Kenny Štorgel (UP FAMNIT and UNM FIS) Naslov / Title: {$\ell$-Facial Edge-Coloring of Plane Graphs} Vsebina / Abstract: A cyclic coloring of a plane graph is a vertex coloring in which all vertices incident with the same face receive distinct colors. It is conjectured that every plane graph with maximum face size$\Delta^*$admits a cyclic edge-coloring with at most$\lfloor 3\Delta^*/2 \rfloor$colors. Since in the case of plane triangulations this coloring corresponds to a proper coloring, the Four Color Theorem implies the conjecture for$\Delta^* = 3$. As a generalization of cyclic coloring, a$k$-facial coloring was introduced, where vertices at facial distance at most$k$receive distinct colors. An open conjecture states that every plane graph admits a$k$-facial coloring with$3k + 1$colors. Similarly, an$\ell$-facial edge-coloring of a plane graph is a coloring of its edges such that any two edges at distance at most$\ell$on a boundary walk of any face receive distinct colors. One can see that this is a more restricted version of the$k$-facial coloring by taking the medial graph$M(G)$of a plane graph$G$. However, there exist graphs that require$3\ell + 1$colors for an$\ell$-facial edge-coloring. Therefore it is also conjectured that$3\ell + 1$colors suffice for an$\ell$-facial edge-coloring of any plane graph. While the cases with$\ell = 1$and$\ell = 2$are already established, the general case is still wide open. In our talk, we give a short history of the topic and present a proof of the case$\ell = 3$.\\ This is a joint work with Borut Lu\v{z}ar. We are looking forward to meeting at the video-conference. Join Zoom Meeting HERE! Everyone is welcome and encouraged to attend. Datum in ura / Date and time: 29.3.21 (10:00 -- 11:00) Predavalnica / Location: Zoom Predavatelj / Lecturer: Ana Grdović Gnip (UP FAMNIT) Naslov / Title: All you need is political love? Assessing the effects of partisan favouritism in Croatia’s public procurement Vsebina / Abstract: This paper discusses the political donations - public procurement interplay. It rests on a unique and comprehensive hand-collected firm-by-tender micro-level dataset that enables the assessment of partisan favouritism in procuring goods, services and work by the Croatian government in the 2012-2018 period. Main results show that (i) political donations pay off and a ten percent increase in political donations leads to an increase in public procurement revenues of 5.7%; (ii) political disloyalty, i.e. switching donations from centre-right to centre-left parties or vice versa, does not reimburse; (iii) big firms in Croatia are big enough to bid lower prices and/or contract better terms, such that they don’t need favouritism in public procurement awards; and (iv) political contributions ex-post election (2016-2018) increase procurement revenues of donating firms by 27%, and firms connected to the losing party exhibit a drop in procurement revenues of more than 12% compared to the ex-ante elections. Join Zoom Meeting HERE! Everyone is welcome and encouraged to attend. Datum in ura / Date and time: 22.3.21 (10:00 -- 11:00) Predavalnica / Location: Zoom Predavatelj / Lecturer: Dieter Rautenbach (Ulm University, Germany) Naslov / Title: Distance-unbalancedness of trees Vsebina / Abstract: For a graph G, and two distinct vertices u and v of G, let nG(u,v) be the number of vertices of G that are closer in G to u than to v. Miklavi\v{c} and \v{S}parl (arXiv:2011.01635v1) define the distance-unbalancedness {uB}(G) of G as the sum of |nG(u,v)-nG(v,u)| over all unordered pairs of distinct vertices u and v of G. For positive integers n up to 15, they determine the trees T of fixed order n with the smallest and the largest values of { uB}(T), respectively. While the smallest value is achieved by the star K1,n-1 for these n, the structure of the trees maximizing the distance-unbalancedness remained unclear. For n up to 15 at least, all these trees were subdivided stars. Contributing to problems posed by Miklavi\v{c} and \v{S}parl, we show that stars minimize distance-unbalancedness among all trees of a given order, that max\{{uB}(T):T is a tree of order n}=n3/2 +o(n3) and that max{uB}(S(n1,…,nk)):1+n1+⋯+nk=n}=(1/2 -5/6k +1/3k2 )n3+O(kn2), where S(n1,…,nk) is the subdivided star such that removing its center vertex leaves paths of orders n1,…,nk. Join Zoom Meeting HERE! See you there! Everyone is welcome and encouraged to attend. For more info visit our YouTube Channel. Datum in ura / Date and time: 15.3.21 (10:00 -- 11:00) Predavalnica / Location: Zoom (See link below) Predavatelj / Lecturer: Vito Vitrih (University of Primorska, Slovenia) Naslov / Title: Design and analysis with curves and surfaces Vsebina / Abstract: Computer-aided geometric design (CAGD) deals with the mathematical description, and computational aspects of geometric objects, such as parametric curves and surfaces. It is a field of mathematical nature with relevant use in computer science and engineering. Approximation theory studies the process of approximating general functions by simple functions such as polynomials or splines. Therefore, it plays a central role in the analysis of numerical methods, particularly in approximation of partial differential equations. During the lecture, I will show how my research interests connect the fields of Computer-aided geometric design and Approximation theory. The following two research topics, in which I have been most active in the last decade, will be briefly presented. Parameterization of curves and surfaces are basic concepts in CAGD. In several applications, it is desirable for these curves and surfaces to have some particular properties, such as polynomial arc-length and rational offsets. A special class of curves that satisfies these requirements are Pythagorean-hodograph curves, of which the first part of my talk will be devoted. In the second part, we will get acquainted with a recent method for numerical solution of partial differential equations, i.e., Isogeometric Analysis. The main advantage of this method is in the use of the same standard CAGD spline functions both for describing the geometry and for the numerical simulation of partial differential equations. The increased smoothness of the spline functions compared to traditional finite elements allows for improved stability and convergence properties. We are looking forward to meeting at the video-conference. Join Zoom Meeting HERE! Everyone is welcome and encouraged to attend. For more info visit our YouTube Channel. Datum in ura / Date and time: 8.3.21 (10:00 -- 11:00) Predavalnica / Location: Zoom Predavatelj / Lecturer: Žiga Velkavrh (UP FAMNIT - UP IAM) Naslov / Title: Selfish generosity: statistical estimation of strategies for indirect human reciprocity Vsebina / Abstract: We often observe that people help strangers in real life. Such altruistic behaviour is puzzling for economics and biology because it promotes the welfare of another person at a cost to oneself. It is also difficult to explain it by long-term strategic motivations when the recipient is a stranger who may not be able to return a favour. Real-life evidence does not offer many opportunities to learn about the motivations behind individual altruism, unfortunately. In this project, we instead investigate reciprocal altruism in a laboratory experiment with people playing a long-term economic game of indirect reciprocity. This experiment provides sufficiently detailed data about motivations for altruism to facilitate the classification of almost 90% of participants into several theoretically feasible strategies. For this, we apply a recently developed statistical method to our indirect reciprocity experiment. We compare the resulting classification to the classifications of three other existing methods in the literature and demonstrate that it is the closest to a consensus measure. We then show how the other three existing methods ignore a learning strategy that is used by almost half of the subjects in one of our experimental treatments. Finally, we compare the strategy classification to people's self-reports and show that these are a very unreliable source of data about individual motivations for altruism. We are looking forward to meeting at the video-conference. Join Zoom Meeting HERE! Everyone is welcome and encouraged to attend. For more info visit our Website and our YouTube Channel. Datum in ura / Date and time: 1.3.21 (10:00 -- 11:00) Predavalnica / Location: Zoom Predavatelj / Lecturer: Safet Penjić (UP FAMNIT and UP IAM, Slovenia) Naslov / Title: On a certain families of a symmetric association schemes with d+1 classes Vsebina / Abstract: Let Γ denote an undirected, connected, regular graph with vertex set X, adjacency matrix A, and d+1 distinct eigenvalues. Let {\cal A}={\cal A}(Γ) denote the subalgebra of Mat_X(C) generated by A. We refer to {\cal A} as the {\em adjacency algebra} of Γ. In this talk, we investigate the algebraic and combinatorial structure of Γ for which the adjacency algebra {\cal A} is closed under Hadamard multiplication. In particular, under this simple assumption, we show the following: (i) {\cal A} has a standard basis {I,F_1,…,F_d}; (ii) for every vertex there exists identical distance-faithful intersection diagram of Γ with d+1 cells; (iii) the graph Γ is quotient-polynomial; and (iv) if we pick F∈{I,F_1,…,F_d} then F has d+1 distinct eigenvalues if and only if span{I,F_1,…,F_d}=span{I,F,…,F^d}. We describe the combinatorial structure of quotient-polynomial graphs with diameter 2 and 4 distinct eigenvalues. This is joint work with Miquel À. Fiol. This talk is based on one part of the preprint available at https://arxiv.org/abs/2009.05343 We are looking forward to meeting at the video-conference. Join Zoom Meeting HERE! Everyone is welcome and encouraged to attend. For more info visit our YouTube Channel. Datum in ura / Date and time: 22.2.21 (10:00 -- 11:00) Predavalnica / Location: Zoom (See link below) Predavatelj / Lecturer: Luke Morgan (UP FAMNIT) Naslov / Title: Shuffling cards with groups Vsebina / Abstract: There are two standard ways to shuffle a deck of cards, the in and out shuffles. For the in shuffle, divide the deck into two piles, hold one pile in each hand and then perfectly interlace the piles, with the top card from the left hand pile being on top of the resulting stack of cards. For the out shuffle, the top card from the right hand pile ends up on top of the resulting stack. Standard card tricks are based on knowing what permutations of the deck of cards may be achieved just by performing the in and out shuffles. Mathematicians answer this question by solving the problem of what permutation group is generated by these two shuffles. Diaconis, Graham and Kantor were the first to solve this problem in full generality - for decks of size 2*n. The answer is usually “as big as possible”, but with some rather beautiful and surprising exceptions. In this talk, I’ll explain how the number of permutations is limited, and give some hints about how to obtain different permutations of the deck. I’ll also present a more general question about a “many handed dealer” who shuffles k*n cards divided into k piles. We are looking forward to meeting at the video-conference. Join Zoom Meeting HERE! Everyone is welcome and encouraged to attend. For more info visit our YouTube Channel. Datum in ura / Date and time: 15.2.21 (15:00 -- 16:00) Predavalnica / Location: ZOOM (See link below) Predavatelj / Lecturer: Francesca Scarabel (York University, Canada) Naslov / Title: A renewal equation model for disease transmission dynamics with contact tracing Vsebina / Abstract: I will present a deterministic model for disease transmission dynamics including diagnosis of symptomatic individuals and contact tracing. The model is structured by time since infection and formulated in terms of the individual disease rates and the parameters characterising diagnosis and contact tracing processes. By incorporating a mechanistic formulation of the processes at the individual level, we obtain an integral equation (delayed in calendar time and advanced in the time since infection) for the probability that an infected individual is detected and isolated at any point in time. This is then coupled with a renewal equation for the total incidence to form a closed system describing the transmission dynamics involving contact tracing. After presenting the derivation of the model, I will conclude with some applications of public health relevance, especially in the context of the ongoing COVID-19 pandemic. Joint work with Lorenzo Pellis (University of Manchester), Nicholas H Ogden (PHAC, Public Health Agency of Canada) and Jianhong Wu (York University). Reference: Scarabel F, Pellis L, Ogden NH, Wu J. A renewal equation model to assess roles and limitations of contact tracing for disease outbreak control, available on medRxiv: https://doi.org/10.1101/2020.12.27.20232934 We are looking forward to meeting at the video-conference. Join Zoom Meeting HERE! Everyone is welcome and encouraged to attend. For more info visit our YouTube Channel. Datum in ura / Date and time: 11.1.21 (10:00 -- 11:00) Predavalnica / Location: ZOOM (See link below) Predavatelj / Lecturer: Petr Golovach (Bergen University, Norway) Naslov / Title: Paths and Cycles Above Combinatorial Bounds Vsebina / Abstract: An undirected graph G d-degenerate if every subgraph of G has a vertex of degree at most d, and the degeneracy is the minimum d such that G is d-degenerate. By the classical theorem of Erdös and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least d+1. The proof of Erdös and Gallai is constructive and can be turned into a polynomial time algorithm constructing a cycle of length at least d+1. But can we decide in polynomial time whether a graph contains a cycle of length at least d+2? An easy reduction from Hamiltonian Cycle provides a negative answer to this question: Deciding whether a graph has a cycle of length at least d+2 is NP-complete. Surprisingly, the complexity of the problem changes drastically when the input graph is 2-connected. In this case we prove that deciding whether G contains a cycle of length at least d+k can be done in time 2^{O(k)}|V(G)|^{O(1)}. Further, we briefly consider similar problem arising from the classical result of Dirac from 1952 that every 2-connected n-vertex graph has a cycle with at least min{2\delta(G),n} vertices. The talk is based on the joint work with Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi, Danil Sagunov, and Kirill Simonov. We are looking forward to meeting at the video-conference. Join Zoom Meeting HERE! Everyone is welcome and encouraged to attend. For more info visit our YouTube Channel. Datum in ura / Date and time: 4.1.21 (10:00 -- 11:00) Predavalnica / Location: ZOOM (See link below) Predavatelj / Lecturer: Ted Dobson (UP FAMNIT, Slovenia) Naslov / Title: Recognizing vertex-transitive digraphs which are wreath products, double coset digraphs, and generalized wreath products Vsebina / Abstract: It is known that a Cayley digraph$\Cay(A,S)$of an abelian group$A$is isomorphic to a nontrivial wreath product if and only if there is a proper nontrivial subgroup$B\le A$such that$S\setminus B$is a union of cosets of$B$in$A$. We generalize this result to Cayley digraphs$\Cay(G,S)$to nonabelian groups$G$by showing that such a digraph is isomorphic to a nontrivial wreath product if and only if there is a proper nontrivial subgroup$H\le G$such that$S\setminus H$is a union of double cosets of$H$in$G$. This result is proven in the more general situation of a double coset digraph (also known as a Sabidussi coset digraph.) We then give applications of this result which include showing the problem of determining automorphism groups of vertex-transitive digraphs is equivalent to the problem of determining automorphism groups of Cayley digraphs, and extending the definition of generalized wreath product digraphs to double coset digraphs of all groups$G\$.

Join Zoom Meeting HERE!

Everyone is welcome and encouraged to attend.

format: plain


text:
# Bernoulli’s hypothesis (18TH CENTURY)

Proposed by Swiss mathematician Daniel Bernoulli (1700-1782), Bernoulli’s hypothesis suggests added dimensions to the evaluation of risk.

Acceptance of a risk depends not only on the nominal value of what may be lost but also on the intrinsic value, or utility, of it to the person accepting the risk.

In economics, game theory, and decision theory, the expected utility hypothesis—concerning people’s preferences with regard to choices that have uncertain outcomes (gambles)—states that the subjective value associated with an individual’s gamble is the statistical expectation of that individual’s valuations of the outcomes of that gamble, where these valuations may differ from the dollar value of those outcomes. The introduction of St. Petersburg Paradox by Daniel Bernoulli in 1738 is considered the beginnings of the hypothesis. This hypothesis has proven useful to explain some popular choices that seem to contradict the expected value criterion (which takes into account only the sizes of the payouts and the probabilities of occurrence), such as occur in the contexts of gambling and insurance.

The von Neumann–Morgenstern utility theorem provides necessary and sufficient conditions under which the expected utility hypothesis holds. From relatively early on, it was accepted that some of these conditions would be violated by real decision-makers in practice but that the conditions could be interpreted nonetheless as ‘axioms’ of rational choice.

Until the mid-twentieth century, the standard term for the expected utility was the moral expectation, contrasted with “mathematical expectation” for the expected value.

Bernoulli came across expected utility by playing the St Petersburg paradox. This paradox involves you flipping a coin until you get to heads. The number of times it took you to get to heads is what you put as an exponent to 2 and receive that in dollar amounts. This game helped to understand what people were willing to pay versus what people were expected to gain from this game.

### Formula for expected utility

When the entity {\displaystyle x} whose value {\displaystyle x_{i}} affects a person’s utility takes on one of a set of discrete values, the formula for expected utility, which is assumed to be maximized, is

{\displaystyle E[u(x)]=p_{1}\cdot u(x_{1})+p_{2}\cdot u(x_{2})+…}

where the left side is the subjective valuation of the gamble as a whole, {\displaystyle x_{i}} is the ith possible outcome, {\displaystyle u(x_{i})} is its valuation, and {\displaystyle p_{i}} is its probability. There could be either a finite set of possible values {\displaystyle x_{i},} in which case the right side of this equation has a finite number of terms; or there could be an infinite set of discrete values, in which case the right side has an infinite number of terms.

When {\displaystyle x} can take on any of a continuous range of values, the expected utility is given by

{\displaystyle E[u(x)]=\int _{-\infty }^{\infty }u(x)f(x)dx,}

where {\displaystyle f(x)} is the probability density function of {\displaystyle x.}

### Expected value and choice under risk

In the presence of risky outcomes, a human decision maker does not always choose the option with higher expected value investments. For example, suppose there is a choice between a guaranteed payment of $1.00, and a gamble in which the probability of getting a$100 payment is 1 in 80 and the alternative, far more likely outcome (79 out of 80) is receiving $0. The expected value of the first alternative is$1.00 and the expected value of the second alternative is $1.25. According to expected value theory, people should choose the$100-or-nothing gamble; however, as stressed by expected utility theory, some people are risk averse enough to prefer the sure thing, despite its lower expected value. People with less risk aversion would choose the riskier, higher-expected-value gamble. This is precedence for utility theory.

### Bernoulli’s formulation

Nicolas Bernoulli described the St. Petersburg paradox (involving infinite expected values) in 1713, prompting two Swiss mathematicians to develop expected utility theory as a solution. The theory can also more accurately describe more realistic scenarios (where expected values are finite) than expected value alone. In 1728, Gabriel Cramer, in a letter to Nicolas Bernoulli, wrote, “the mathematicians estimate money in proportion to its quantity, and men of good sense in proportion to the usage that they may make of it.”

In 1738, Nicolas’ cousin Daniel Bernoulli, published the canonical 18th Century description of this solution in Specimen theoriae novae de mensura sortis or Exposition of a New Theory on the Measurement of Risk. Daniel Bernoulli proposed that a nonlinear function of utility of an outcome should be used instead of the expected value of an outcome, accounting for risk aversion, where the risk premium is higher for low-probability events than the difference between the payout level of a particular outcome and its expected value. Bernoulli further proposed that it was not the goal of the gambler to maximize his expected gain but to instead maximize the logarithm of his gain.

Bernoulli’s paper was the first formalization of marginal utility, which has broad application in economics in addition to expected utility theory. He used this concept to formalize the idea that the same amount of additional money was less useful to an already-wealthy person than it would be to a poor person.

### Infinite expected value—St. Petersburg paradox

The St. Petersburg paradox (named after the journal in which Bernoulli’s paper was published) arises when there is no upper bound on the potential rewards from very low probability events. Because some probability distribution functions have an infinite expected value, an expected-wealth maximizing person would pay an arbitrarily large finite amount to take this gamble. In real life, people do not do this.

Bernoulli proposed a solution to this paradox in his paper: the utility function used in real life means that the expected utility of the gamble is finite, even if its expected value is infinite. (Thus he hypothesized diminishing marginal utility of increasingly larger amounts of money.) It has also been resolved differently by other economists by proposing that very low probability events are neglected, by taking into account the finite resources of the participants, or by noting that one simply cannot buy that which is not sold (and that sellers would not produce a lottery whose expected loss to them were unacceptable).

### Savage’s Framework

In the 1950s Leonard Jimmie Savage, an American statistician, derived a framework for comprehending expected utility. At that point, it was considered the first and most thorough foundation to understanding the concept. Savage’s framework involved proving that expected utility could be used to make an optimal choice among several acts through seven postulates (notated as P1-P7).

Savage’s framework has since been used in neo-Bayesian statistics (see Bayesian probability) and the field of applied statistics.

### Von Neumann–Morgenstern formulation

The von Neumann–Morgenstern axioms

There are four axioms of the expected utility theory that define a rational decision maker. They are completeness, transitivity, independence and continuity.

Completeness assumes that an individual has well defined preferences and can always decide between any two alternatives.

• Axiom (Completeness): For every A and B either {\displaystyle A\succeq B} or {\displaystyle A\preceq B}.

This means that the individual either prefers A to B, or is indifferent between A and B, or prefers B to A.

Transitivity assumes that, as an individual decides according to the completeness axiom, the individual also decides consistently.

• Axiom (Transitivity): For every A, B and C with {\displaystyle A\succeq B} and {\displaystyle B\succeq C} we must have {\displaystyle A\succeq C}.

Independence of irrelevant alternatives pertains to well-defined preferences as well. It assumes that two gambles mixed with an irrelevant third one will maintain the same order of preference as when the two are presented independently of the third one. The independence axiom is the most controversial axiom.[citation needed].

• Axiom (Independence of irrelevant alternatives): Let A, B, and C be three lotteries with {\displaystyle A\succeq B}, and let {\displaystyle t} be the probability that a third choice is present: {\displaystyle t\in [0,1]};
if {\displaystyle tA+(1-t)C\succeq tB+(1-t)C,} then the third choice, C, is irrelevant, and the order of preference for A before B holds, independently of the presence of C.

Continuity assumes that when there are three lotteries (A, B and C) and the individual prefers A to B and B to C, then there should be a possible combination of A and C in which the individual is then indifferent between this mix and the lottery B.

• Axiom (Continuity): Let A, B and C be lotteries with {\displaystyle A\succeq B\succeq C}; then there exists a probability p such that B is equally good as {\displaystyle pA+(1-p)C}.

If all these axioms are satisfied, then the individual is said to be rational and the preferences can be represented by a utility function, i.e. one can assign numbers (utilities) to each outcome of the lottery such that choosing the best lottery according to the preference {\displaystyle \succeq } amounts to choosing the lottery with the highest expected utility. This result is called the von Neumann–Morgenstern utility representation theorem.

In other words, if an individual’s behavior always satisfies the above axioms, then there is a utility function such that the individual will choose one gamble over another if and only if the expected utility of one exceeds that of the other. The expected utility of any gamble may be expressed as a linear combination of the utilities of the outcomes, with the weights being the respective probabilities. Utility functions are also normally continuous functions. Such utility functions are also referred to as von Neumann–Morgenstern (vNM) utility functions. This is a central theme of the expected utility hypothesis in which an individual chooses not the highest expected value, but rather the highest expected utility. The expected utility maximizing individual makes decisions rationally based on the axioms of the theory.

The von Neumann–Morgenstern formulation is important in the application of set theory to economics because it was developed shortly after the Hicks–Allen “ordinal revolution” of the 1930s, and it revived the idea of cardinal utility in economic theory.[citation needed] However, while in this context the utility function is cardinal, in that implied behavior would be altered by a non-linear monotonic transformation of utility, the expected utility function is ordinal because any monotonic increasing transformation of expected utility gives the same behavior.

### Risk aversion

The expected utility theory takes into account that individuals may be risk-averse, meaning that the individual would refuse a fair gamble (a fair gamble has an expected value of zero). Risk aversion implies that their utility functions are concave and show diminishing marginal wealth utility. The risk attitude is directly related to the curvature of the utility function: risk neutral individuals have linear utility functions, while risk seeking individuals have convex utility functions and risk averse individuals have concave utility functions. The degree of risk aversion can be measured by the curvature of the utility function.

Since the risk attitudes are unchanged under affine transformations of u, the second derivative u” is not an adequate measure of the risk aversion of a utility function. Instead, it needs to be normalized. This leads to the definition of the Arrow–Pratt measure of absolute risk aversion:

{\displaystyle {\mathit {ARA}}(w)=-{\frac {u”(w)}{u'(w)}},}

where {\displaystyle w} is wealth.

The Arrow–Pratt measure of relative risk aversion is:

{\displaystyle {\mathit {RRA}}(w)=-{\frac {wu”(w)}{u'(w)}}}

Special classes of utility functions are the CRRA (constant relative risk aversion) functions, where RRA(w) is constant, and the CARA (constant absolute risk aversion) functions, where ARA(w) is constant. They are often used in economics for simplification.

A decision that maximizes expected utility also maximizes the probability of the decision’s consequences being preferable to some uncertain threshold (Castagnoli and LiCalzi,1996; Bordley and LiCalzi,2000; Bordley and Kirkwood).[citation needed] In the absence of uncertainty about the threshold, expected utility maximization simplifies to maximizing the probability of achieving some fixed target. If the uncertainty is uniformly distributed, then expected utility maximization becomes expected value maximization. Intermediate cases lead to increasing risk aversion above some fixed threshold and increasing risk seeking below a fixed threshold.

### Examples of von Neumann-Morgenstern utility functions

The utility function {\displaystyle u(w)=\log(w)} was originally suggested by Bernoulli (see above). It has relative risk aversion constant and equal to one, and is still sometimes assumed in economic analyses. The utility function

{\displaystyle u(w)=-e^{-aw}}

exhibits constant absolute risk aversion, and for this reason is often avoided, although it has the advantage of offering substantial mathematical tractability when asset returns are normally distributed. Note that, as per the affine transformation property alluded to above, the utility function {\displaystyle K-e^{-aw}} gives exactly the same preferences orderings as does {\displaystyle -e^{-aw}}; thus it is irrelevant that the values of {\displaystyle -e^{-aw}} and its expected value are always negative: what matters for preference ordering is which of two gambles gives the higher expected utility, not the numerical values of those expected utilities.

The class of constant relative risk aversion utility functions contains three categories. Bernoulli’s utility function

{\displaystyle u(w)=\log(w)}

has relative risk aversion equal to 1. The functions

{\displaystyle u(w)=w^{\alpha }}

for {\displaystyle \alpha \in (0,1)} have relative risk aversion equal to {\displaystyle 1-\alpha \in (0,1)}. And the functions

{\displaystyle u(w)=-w^{\alpha }}

for {\displaystyle \alpha <0} have relative risk aversion equal to {\displaystyle 1-\alpha >1.}

See also the discussion of utility functions having hyperbolic absolute risk aversion (HARA).

### Measuring risk in the expected utility context

Often people refer to “risk” in the sense of a potentially quantifiable entity. In the context of mean-variance analysis, variance is used as a risk measure for portfolio return; however, this is only valid if returns are normally distributed or otherwise jointly elliptically distributed, or in the unlikely case in which the utility function has a quadratic form. However, David E. Bell proposed a measure of risk which follows naturally from a certain class of von Neumann-Morgenstern utility functions. Let utility of wealth be given by

{\displaystyle u(w)=w-be^{-aw}}

for individual-specific positive parameters a and b. Then expected utility is given by

{\displaystyle {\begin{aligned}\operatorname {E} [u(w)]&=\operatorname {E} [w]-b\operatorname {E} [e^{-aw}]\\&=\operatorname {E} [w]-b\operatorname {E} [e^{-a\operatorname {E} [w]-a(w-\operatorname {E} [w])}]\\&=\operatorname {E} [w]-be^{-a\operatorname {E} [w]}\operatorname {E} [e^{-a(w-\operatorname {E} [w])}]\\&={\text{Expected wealth}}-b\cdot e^{-a\cdot {\text{Expected wealth}}}\cdot {\text{Risk}}.\end{aligned}}}

Thus the risk measure is {\displaystyle \operatorname {E} (e^{-a(w-\operatorname {E} w)})}, which differs between two individuals if they have different values of the parameter {\displaystyle a,} allowing different people to disagree about the degree of risk associated with any given portfolio. Individuals sharing a given risk measure (based on given value of a) may choose different portfolios because they may have different values of b. See also Entropic risk measure.

For general utility functions, however, expected utility analysis does not permit the expression of preferences to be separated into two parameters with one representing the expected value of the variable in question and the other representing its risk.

### Criticism

Expected utility theory is a theory about how to make optimal decisions under risk. It has a normative interpretation which economists particularly used to think applies in all situations to rational agents but now tend to regard as a useful and insightful first order approximation. In empirical applications, a number of violations have been shown to be systematic and these falsifications have deepened understanding of how people actually decide. Daniel Kahneman and Amos Tversky in 1979 presented their prospect theory which showed empirically, among other things, how preferences of individuals are inconsistent among the same choices, depending on how those choices are presented.

Like any mathematical model, expected utility theory is an abstraction and simplification of reality. The mathematical correctness of expected utility theory and the salience of its primitive concepts do not guarantee that expected utility theory is a reliable guide to human behavior or optimal practice.

The mathematical clarity of expected utility theory has helped scientists design experiments to test its adequacy, and to distinguish systematic departures from its predictions. This has led to the field of behavioral finance, which has produced deviations from expected utility theory to account for the empirical facts.

### Conservatism in updating beliefs

It is well established that humans find logic hard, mathematics harder, and probability even more challenging.[citation needed] Psychologists have discovered systematic violations of probability calculations and behavior by humans.[citation needed] Consider, for example, the Monty Hall problem.

In updating probability distributions using evidence, a standard method uses conditional probability, namely the rule of Bayes. An experiment on belief revision has suggested that humans change their beliefs faster when using Bayesian methods than when using informal judgment.

### Irrational deviations

Behavioral finance has produced several generalized expected utility theories to account for instances where people’s choices deviate from those predicted by expected utility theory. These deviations are described as “irrational” because they can depend on the way the problem is presented, not on the actual costs, rewards, or probabilities involved.

Particular theories include prospect theory, rank-dependent expected utility and cumulative prospect theory and SP/A theory.[

### Preference reversals over uncertain outcomes

Starting with studies such as Lichtenstein & Slovic (1971), it was discovered that subjects sometimes exhibit signs of preference reversals with regard to their certainty equivalents of different lotteries. Specifically, when eliciting certainty equivalents, subjects tend to value “p bets” (lotteries with a high chance of winning a low prize) lower than “$bets” (lotteries with a small chance of winning a large prize). When subjects are asked which lotteries they prefer in direct comparison, however, they frequently prefer the “p bets” over “$ bets”. Many studies have examined this “preference reversal”, from both an experimental (e.g., Plott & Grether, 1979) and theoretical (e.g., Holt, 1986) standpoint, indicating that this behavior can be brought into accordance with neoclassical economic theory under specific assumptions.

### Uncertain probabilities

If one is using the frequentist notion of probability, where probabilities are considered to be fixed values, then applying expected value and expected utility to decision-making requires knowing the probabilities of various outcomes. However, in practice there will be many situations where the probabilities are unknown, and one is operating under uncertainty. In economics, Knightian uncertainty or ambiguity may occur. Thus one must make assumptions about the probabilities, but then the expected values of various decisions can be very sensitive to the assumptions. This is particularly a problem when the expectation is dominated by rare extreme events, as in a long-tailed distribution.

Alternative decision techniques are robust to uncertainty of probability of outcomes, either not depending on probabilities of outcomes and only requiring scenario analysis (as in minimax or minimax regret), or being less sensitive to assumptions.

Bayesian approaches to probability treat it as a degree of belief and thus they do not draw a distinction between risk and a wider concept of uncertainty: they deny the existence of Knightian uncertainty. They would model uncertain probabilities with hierarchical models, i.e. where the uncertain probabilities are modelled as distributions whose parameters are themselves drawn from a higher-level distribution (hyperpriors).

Also see: bounded rationality, st petersburg paradox, uncertainty

### 3 thoughts on “Bernoulli’s hypothesis (18TH CENTURY)”

1. Carson says:

This post presents clear idea in favor of the new people of blogging, that actually how to do blogging.

2. Lakesha says:

Spot on with this write-up, I actually feel this site needs far more attention.
I’ll probably be returning to read
through more, thanks for the information!