Welcome!
@ Erel Segal: In your edit of the page "Integer Programming" on 4th November, 2020 at 17:06 - you mention that "Lenstra's algorithm implies that ILP is polynomial-time solvable also in the dual case, in which n is varying but m (the number of constraints) is constant." Can you add citation to prove this claim? To the best of my knowledge, it is valid only if m+||A|| is constant (Theorem 2, Ganian et al. "Solving integer linear programs by exploiting variable-constraint interactions: A survey." Algorithms 12.12 (2019): 248). If your claim is indeed correct, could you please add the relevant citation or proof to support it?
Hello, I redirected the page Hole (topology) that you created to homotopy group. The reason is that "hole" is not a standard notion in topology, and the content of the page was essentially duplicate with that of the page on homotopy groups. Best, jraimbau ( talk) 12:05, 8 May 2022 (UTC)
Hello, Erel Segal Thank you for creating Homotopic connectivity.
User:SunDawn, while examining this page as a part of our page curation process, had the following comments:
Thanks for the article!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
.
(Message delivered via the Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 15:41, 29 May 2022 (UTC)
Hello, Erel Segal. Thank you for your work on Subdivision (simplicial complex). User:SunDawn, while examining this page as a part of our page curation process, had the following comments:
Thanks for creating the article!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 23:49, 14 December 2022 (UTC)
Hello, Erel Segal. Thank you for your work on Optimal kidney exchange. User:SunDawn, while examining this page as a part of our page curation process, had the following comments:
Thank you for creating the article! Keep writing!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 02:28, 18 January 2023 (UTC)
Dear Dr. Segal, thanks for creating this exceptional article. It was very interesting and enlightening to learn more about Brouwer-fixed point theorem from the computational perspective. Saung Tadashi ( talk) 20:29, 17 April 2023 (UTC)
![]() |
Hello, Erel Segal!
Having an article draft declined at Articles for Creation can be disappointing. If you are wondering why your article submission was declined, please post a question at the
Articles for creation help desk. If you have any other questions about your editing experience, we'd love to help you at the
Teahouse, a friendly space on Wikipedia where experienced editors lend a hand to help new editors like yourself! See you there!
AngusW🐶🐶F (
bark •
sniff)
16:26, 18 April 2023 (UTC)
|
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Multi-issue voting, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 16:00, 19 April 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
School choice, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 11:06, 22 May 2023 (UTC)
Template:Ordinal vs. cardinal utility has been
nominated for deletion. You are invited to comment on the discussion at
the entry on the Templates for discussion page.
Izno (
talk)
17:52, 2 June 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Budget-proposal aggregation, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 11:01, 15 October 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Budget-proposal aggregation, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 07:43, 16 October 2023 (UTC)
An automated process has detected that when you recently edited Participatory budgeting rule, you added a link pointing to the disambiguation page Facility location problem.
( Opt-out instructions.) -- DPL bot ( talk) 06:03, 24 October 2023 (UTC)
I have posted a question regarding the name change at the talk page of the article. Will Orrick ( talk) 11:11, 5 November 2023 (UTC)
An automated process has detected that when you recently edited Multi-issue voting, you added a link pointing to the disambiguation page Local search.
( Opt-out instructions.) -- DPL bot ( talk) 06:06, 7 November 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Random utility model, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 13:59, 7 November 2023 (UTC)
Your edit to
Draft:Random utility model has been removed in whole or in part, as it appears to have added
copyrighted material to Wikipedia without evidence of
permission from the copyright holder. If you are the copyright holder, please read
Wikipedia:Donating copyrighted materials for more information on uploading your material to Wikipedia. For legal reasons, Wikipedia cannot accept copyrighted material, including text or images from print publications or from other websites, without an appropriate and verifiable license. All such contributions will be deleted. You may use external websites or publications as a source of information, but not as a source of content, such as sentences or images—you must write using your own words. Wikipedia takes copyright very seriously, and persistent violators of our copyright policy will be
blocked from editing. See
Wikipedia:Copying text from other sources for more information. —
Diannaa (
talk)
23:47, 7 November 2023 (UTC)
Hello, Erel Segal,
Thank you for creating Median voting rule.
I have tagged the page as having some issues to fix, as a part of our page curation process and note that:
This is a very interesting subject and well-worthwhile for Wikipedia. However, there are entire sections that lack in-line citations. Consistent with Wikipedia's guidelines on citing sources, more in-line citations should be added.
The tags can be removed by you or another editor once the issues they mention are addressed. If you have questions, leave a comment here and begin it with {{Re|Nolabob}}
. Remember to sign your reply with ~~~~
. For broader editing help, please visit the
Teahouse.
Delivered via the Page Curation tool, on behalf of the reviewer.
Nolabob ( talk) 13:21, 14 November 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Median voting rule, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 11:35, 15 November 2023 (UTC)
Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 11 December 2023. All eligible users are allowed to vote. Users with alternate accounts may only vote once.
The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.
If you wish to participate in the 2023 election, please review
the candidates and submit your choices on the
voting page. If you no longer wish to receive these messages, you may add {{
NoACEMM}}
to your user talk page.
MediaWiki message delivery (
talk)
00:34, 28 November 2023 (UTC)
Your edit to
Double auction has been removed in whole or in part, as it appears to have added
copyrighted material to Wikipedia without evidence of
permission from the copyright holder. If you are the copyright holder, please read
Wikipedia:Donating copyrighted materials for more information on uploading your material to Wikipedia. For legal reasons, Wikipedia cannot accept copyrighted material, including text or images from print publications or from other websites, without an appropriate and verifiable license. All such contributions will be deleted. You may use external websites or publications as a source of information, but not as a source of content, such as sentences or images—you must write using your own words. Wikipedia takes copyright very seriously, and persistent violators of our copyright policy will be
blocked from editing. See
Wikipedia:Copying text from other sources for more information. —
Diannaa (
talk)
17:12, 17 December 2023 (UTC)
An automated process has detected that when you recently edited Interior-point method, you added a link pointing to the disambiguation page Potential function.
( Opt-out instructions.) -- DPL bot ( talk) 06:03, 21 December 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Fair random assignment, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 11:16, 1 January 2024 (UTC)
An automated process has detectedthat when you recently edited Strong Nash equilibrium, you added a link pointing to the disambiguation page Concave.
( Opt-out instructions.) -- DPL bot ( talk) 17:48, 10 January 2024 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Regret-free mechanism, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 20:23, 15 January 2024 (UTC)
An article you recently created,
Participatory budgeting experiments, is not suitable as written to remain published. It needs more citations from
reliable,
independent sources. (
?) As written, the article contains too many statements and claims that are not supported by inline citations. Information that can't be referenced should be removed (
verifiability is of
central importance on Wikipedia). I've moved your draft to
draftspace (with a prefix of "Draft:
" before the article title) where you can incubate the article with minimal disruption. When you feel the article meets Wikipedia's
general notability guideline and thus is ready for mainspace, please click on the "Submit your draft for review!" button at the top of the page.
Mccapra (
talk)
03:38, 30 January 2024 (UTC)
Moved back into mainspace and marked a# reviewed. Many thanks Mccapra ( talk) 14:43, 30 January 2024 (UTC)
and so on.
Mccapra (
talk)
08:12, 30 January 2024 (UTC)
Hello, Erel Segal. Thank you for your work on N-dimensional polyhedron. SunDawn, while examining this page as a part of our page curation process, had the following comments:
Hello my friend! Good day to you. Thanks for creating the article, I have marked it as reviewed. Have a blessed day!
✠ SunDawn ✠ (contact) 15:10, 30 January 2024 (UTC)
@ SunDawn: Thanks! -- Erel Segal ( talk) 15:13, 30 January 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Power cone. SunDawn, while examining this page as a part of our page curation process, had the following comments:
Hello my friend! Good day to you. Thanks for creating the article, I have marked it as reviewed. Have a blessed day!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 04:30, 31 January 2024 (UTC)
Erel Segal ( block log • active blocks • global blocks • contribs • deleted contribs • filter log • creation log • change block settings • unblock • checkuser ( log))
Request reason:
Whenever I am connected to the Internet from my university's wifi network, I get a message that my IP range "212.179.0.0/16 " is blocked because it is a web-host provider, and so I cannot edit Wikipedia from within the university. Is it possible to make an exception for registered users for this IP?
Decline reason:
We can't do that, but you can go to WP:IPECPROXY and follow the instructions there to request IP block exemption by email, which would be the same thing. — Daniel Case ( talk) 07:34, 1 February 2024 (UTC)
If you want to make any further unblock requests, please read the guide to appealing blocks first, then use the {{ unblock}} template again. If you make too many unconvincing or disruptive unblock requests, you may be prevented from editing this page until your block has expired. Do not remove this unblock review while you are blocked.
-- Erel Segal ( talk) 13:04, 31 January 2024 (UTC)
I have granted your account an exemption from IP blocking. This will allow you to edit the English Wikipedia through full blocks affecting your IP address when you are logged in.
Please read the page Wikipedia:IP block exemption carefully, especially the section on IP block exemption conditions. Inappropriate usage of this user right may result in revocation. I hope this will enhance your editing, and allow you to edit successfully and without disruption. Daniel Case ( talk) 16:28, 15 February 2024 (UTC) Daniel Case ( talk) 16:28, 15 February 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Median voting rule. North8000, while examining this page as a part of our page curation process, had the following comments:
Is this a duplication or overlap with Median voter theorem or Highest median voting rules?
North8000 ( talk) 12:42, 8 February 2024 (UTC)
@ North8000: No - this is why I put the "do not confuse" note at the top. I explain the differences between the terms in the "Related concepts" section at the bottom. -- Erel Segal ( talk) 18:46, 8 February 2024 (UTC)
Hi, I was confused by your recent edit to the NP-hardness page. I agree with you (and was interested to learn!) that some undecidable problems are not NP-hard. But I don't see why this contradicts the informal statement "NP-hard problems are at least as hard as the hardest problems in NP". Indeed, the undecidable problems in question are not in NP.
Putting it otherwise, the informal statement says that "if Π is an NP-hard problem and Π' is a problem in NP, then Π is at least as hard as Π'". And indeed, then, Π' reduces to Π by definition. So I don't see why you find this informal statement to be inaccurate.
What do you think? Could you explain more (to me, and/or on NP-hardness) why you find the statement inaccurate? For now my opinion would be that we should mention the fact about non-NP-hard undecidable problems, but that we could keep the statement. Thanks! -- a3nm ( talk) 08:49, 10 February 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Fully proportional representation. North8000, while examining this page as a part of our page curation process, had the following comments:
Nice work
To reply, leave a comment here and begin it with {{Re|North8000}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
North8000 ( talk) 22:19, 15 February 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Dominant resource fairness. SunDawn, while examining this page as a part of our page curation process, had the following comments:
Good day! Thank you for contributing to Wikipedia by writing this article. I have marked the article as reviewed. Have a wonderful and blessed day for you and your family!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 08:21, 10 April 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Compilation complexity. SunDawn, while examining this page as a part of our page curation process, had the following comments:
Good day! Thank you for contributing to Wikipedia by writing this article. I have marked the article as reviewed. Have a wonderful and blessed day for you and your family!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 15:41, 19 April 2024 (UTC)
Hello, Erel Segal. It has been over six months since you last edited the Articles for Creation submission or draft page you started, " Random utility model".
In accordance with our policy that Wikipedia is not for the indefinite hosting of material, the draft has been deleted. When you plan on working on it further and you wish to retrieve it, you can request its undeletion. An administrator will, in most cases, restore the submission so you can continue to work on it.
Thank you for your submission to Wikipedia, and happy editing. ✗ plicit 05:44, 11 May 2024 (UTC)
The article will be discussed at Wikipedia:Articles for deletion/Burr dilemma until a consensus is reached, and anyone, including you, is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on high-quality evidence and our policies and guidelines.
Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article until the discussion has finished.Welcome!
@ Erel Segal: In your edit of the page "Integer Programming" on 4th November, 2020 at 17:06 - you mention that "Lenstra's algorithm implies that ILP is polynomial-time solvable also in the dual case, in which n is varying but m (the number of constraints) is constant." Can you add citation to prove this claim? To the best of my knowledge, it is valid only if m+||A|| is constant (Theorem 2, Ganian et al. "Solving integer linear programs by exploiting variable-constraint interactions: A survey." Algorithms 12.12 (2019): 248). If your claim is indeed correct, could you please add the relevant citation or proof to support it?
Hello, I redirected the page Hole (topology) that you created to homotopy group. The reason is that "hole" is not a standard notion in topology, and the content of the page was essentially duplicate with that of the page on homotopy groups. Best, jraimbau ( talk) 12:05, 8 May 2022 (UTC)
Hello, Erel Segal Thank you for creating Homotopic connectivity.
User:SunDawn, while examining this page as a part of our page curation process, had the following comments:
Thanks for the article!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
.
(Message delivered via the Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 15:41, 29 May 2022 (UTC)
Hello, Erel Segal. Thank you for your work on Subdivision (simplicial complex). User:SunDawn, while examining this page as a part of our page curation process, had the following comments:
Thanks for creating the article!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 23:49, 14 December 2022 (UTC)
Hello, Erel Segal. Thank you for your work on Optimal kidney exchange. User:SunDawn, while examining this page as a part of our page curation process, had the following comments:
Thank you for creating the article! Keep writing!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 02:28, 18 January 2023 (UTC)
Dear Dr. Segal, thanks for creating this exceptional article. It was very interesting and enlightening to learn more about Brouwer-fixed point theorem from the computational perspective. Saung Tadashi ( talk) 20:29, 17 April 2023 (UTC)
![]() |
Hello, Erel Segal!
Having an article draft declined at Articles for Creation can be disappointing. If you are wondering why your article submission was declined, please post a question at the
Articles for creation help desk. If you have any other questions about your editing experience, we'd love to help you at the
Teahouse, a friendly space on Wikipedia where experienced editors lend a hand to help new editors like yourself! See you there!
AngusW🐶🐶F (
bark •
sniff)
16:26, 18 April 2023 (UTC)
|
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Multi-issue voting, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 16:00, 19 April 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
School choice, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 11:06, 22 May 2023 (UTC)
Template:Ordinal vs. cardinal utility has been
nominated for deletion. You are invited to comment on the discussion at
the entry on the Templates for discussion page.
Izno (
talk)
17:52, 2 June 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Budget-proposal aggregation, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 11:01, 15 October 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Budget-proposal aggregation, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 07:43, 16 October 2023 (UTC)
An automated process has detected that when you recently edited Participatory budgeting rule, you added a link pointing to the disambiguation page Facility location problem.
( Opt-out instructions.) -- DPL bot ( talk) 06:03, 24 October 2023 (UTC)
I have posted a question regarding the name change at the talk page of the article. Will Orrick ( talk) 11:11, 5 November 2023 (UTC)
An automated process has detected that when you recently edited Multi-issue voting, you added a link pointing to the disambiguation page Local search.
( Opt-out instructions.) -- DPL bot ( talk) 06:06, 7 November 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Random utility model, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 13:59, 7 November 2023 (UTC)
Your edit to
Draft:Random utility model has been removed in whole or in part, as it appears to have added
copyrighted material to Wikipedia without evidence of
permission from the copyright holder. If you are the copyright holder, please read
Wikipedia:Donating copyrighted materials for more information on uploading your material to Wikipedia. For legal reasons, Wikipedia cannot accept copyrighted material, including text or images from print publications or from other websites, without an appropriate and verifiable license. All such contributions will be deleted. You may use external websites or publications as a source of information, but not as a source of content, such as sentences or images—you must write using your own words. Wikipedia takes copyright very seriously, and persistent violators of our copyright policy will be
blocked from editing. See
Wikipedia:Copying text from other sources for more information. —
Diannaa (
talk)
23:47, 7 November 2023 (UTC)
Hello, Erel Segal,
Thank you for creating Median voting rule.
I have tagged the page as having some issues to fix, as a part of our page curation process and note that:
This is a very interesting subject and well-worthwhile for Wikipedia. However, there are entire sections that lack in-line citations. Consistent with Wikipedia's guidelines on citing sources, more in-line citations should be added.
The tags can be removed by you or another editor once the issues they mention are addressed. If you have questions, leave a comment here and begin it with {{Re|Nolabob}}
. Remember to sign your reply with ~~~~
. For broader editing help, please visit the
Teahouse.
Delivered via the Page Curation tool, on behalf of the reviewer.
Nolabob ( talk) 13:21, 14 November 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Median voting rule, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 11:35, 15 November 2023 (UTC)
Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on Monday, 11 December 2023. All eligible users are allowed to vote. Users with alternate accounts may only vote once.
The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.
If you wish to participate in the 2023 election, please review
the candidates and submit your choices on the
voting page. If you no longer wish to receive these messages, you may add {{
NoACEMM}}
to your user talk page.
MediaWiki message delivery (
talk)
00:34, 28 November 2023 (UTC)
Your edit to
Double auction has been removed in whole or in part, as it appears to have added
copyrighted material to Wikipedia without evidence of
permission from the copyright holder. If you are the copyright holder, please read
Wikipedia:Donating copyrighted materials for more information on uploading your material to Wikipedia. For legal reasons, Wikipedia cannot accept copyrighted material, including text or images from print publications or from other websites, without an appropriate and verifiable license. All such contributions will be deleted. You may use external websites or publications as a source of information, but not as a source of content, such as sentences or images—you must write using your own words. Wikipedia takes copyright very seriously, and persistent violators of our copyright policy will be
blocked from editing. See
Wikipedia:Copying text from other sources for more information. —
Diannaa (
talk)
17:12, 17 December 2023 (UTC)
An automated process has detected that when you recently edited Interior-point method, you added a link pointing to the disambiguation page Potential function.
( Opt-out instructions.) -- DPL bot ( talk) 06:03, 21 December 2023 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Fair random assignment, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 11:16, 1 January 2024 (UTC)
An automated process has detectedthat when you recently edited Strong Nash equilibrium, you added a link pointing to the disambiguation page Concave.
( Opt-out instructions.) -- DPL bot ( talk) 17:48, 10 January 2024 (UTC)
Hello, I'm
Qwerfjkl (bot). I have automatically detected that
this edit performed by you, on the page
Regret-free mechanism, may have introduced referencing errors. They are as follows:
Please check this page and fix the errors highlighted. If you think this is a false positive, you can report it to my operator. Thanks, Qwerfjkl (bot) ( talk) 20:23, 15 January 2024 (UTC)
An article you recently created,
Participatory budgeting experiments, is not suitable as written to remain published. It needs more citations from
reliable,
independent sources. (
?) As written, the article contains too many statements and claims that are not supported by inline citations. Information that can't be referenced should be removed (
verifiability is of
central importance on Wikipedia). I've moved your draft to
draftspace (with a prefix of "Draft:
" before the article title) where you can incubate the article with minimal disruption. When you feel the article meets Wikipedia's
general notability guideline and thus is ready for mainspace, please click on the "Submit your draft for review!" button at the top of the page.
Mccapra (
talk)
03:38, 30 January 2024 (UTC)
Moved back into mainspace and marked a# reviewed. Many thanks Mccapra ( talk) 14:43, 30 January 2024 (UTC)
and so on.
Mccapra (
talk)
08:12, 30 January 2024 (UTC)
Hello, Erel Segal. Thank you for your work on N-dimensional polyhedron. SunDawn, while examining this page as a part of our page curation process, had the following comments:
Hello my friend! Good day to you. Thanks for creating the article, I have marked it as reviewed. Have a blessed day!
✠ SunDawn ✠ (contact) 15:10, 30 January 2024 (UTC)
@ SunDawn: Thanks! -- Erel Segal ( talk) 15:13, 30 January 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Power cone. SunDawn, while examining this page as a part of our page curation process, had the following comments:
Hello my friend! Good day to you. Thanks for creating the article, I have marked it as reviewed. Have a blessed day!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 04:30, 31 January 2024 (UTC)
Erel Segal ( block log • active blocks • global blocks • contribs • deleted contribs • filter log • creation log • change block settings • unblock • checkuser ( log))
Request reason:
Whenever I am connected to the Internet from my university's wifi network, I get a message that my IP range "212.179.0.0/16 " is blocked because it is a web-host provider, and so I cannot edit Wikipedia from within the university. Is it possible to make an exception for registered users for this IP?
Decline reason:
We can't do that, but you can go to WP:IPECPROXY and follow the instructions there to request IP block exemption by email, which would be the same thing. — Daniel Case ( talk) 07:34, 1 February 2024 (UTC)
If you want to make any further unblock requests, please read the guide to appealing blocks first, then use the {{ unblock}} template again. If you make too many unconvincing or disruptive unblock requests, you may be prevented from editing this page until your block has expired. Do not remove this unblock review while you are blocked.
-- Erel Segal ( talk) 13:04, 31 January 2024 (UTC)
I have granted your account an exemption from IP blocking. This will allow you to edit the English Wikipedia through full blocks affecting your IP address when you are logged in.
Please read the page Wikipedia:IP block exemption carefully, especially the section on IP block exemption conditions. Inappropriate usage of this user right may result in revocation. I hope this will enhance your editing, and allow you to edit successfully and without disruption. Daniel Case ( talk) 16:28, 15 February 2024 (UTC) Daniel Case ( talk) 16:28, 15 February 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Median voting rule. North8000, while examining this page as a part of our page curation process, had the following comments:
Is this a duplication or overlap with Median voter theorem or Highest median voting rules?
North8000 ( talk) 12:42, 8 February 2024 (UTC)
@ North8000: No - this is why I put the "do not confuse" note at the top. I explain the differences between the terms in the "Related concepts" section at the bottom. -- Erel Segal ( talk) 18:46, 8 February 2024 (UTC)
Hi, I was confused by your recent edit to the NP-hardness page. I agree with you (and was interested to learn!) that some undecidable problems are not NP-hard. But I don't see why this contradicts the informal statement "NP-hard problems are at least as hard as the hardest problems in NP". Indeed, the undecidable problems in question are not in NP.
Putting it otherwise, the informal statement says that "if Π is an NP-hard problem and Π' is a problem in NP, then Π is at least as hard as Π'". And indeed, then, Π' reduces to Π by definition. So I don't see why you find this informal statement to be inaccurate.
What do you think? Could you explain more (to me, and/or on NP-hardness) why you find the statement inaccurate? For now my opinion would be that we should mention the fact about non-NP-hard undecidable problems, but that we could keep the statement. Thanks! -- a3nm ( talk) 08:49, 10 February 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Fully proportional representation. North8000, while examining this page as a part of our page curation process, had the following comments:
Nice work
To reply, leave a comment here and begin it with {{Re|North8000}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
North8000 ( talk) 22:19, 15 February 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Dominant resource fairness. SunDawn, while examining this page as a part of our page curation process, had the following comments:
Good day! Thank you for contributing to Wikipedia by writing this article. I have marked the article as reviewed. Have a wonderful and blessed day for you and your family!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 08:21, 10 April 2024 (UTC)
Hello, Erel Segal. Thank you for your work on Compilation complexity. SunDawn, while examining this page as a part of our page curation process, had the following comments:
Good day! Thank you for contributing to Wikipedia by writing this article. I have marked the article as reviewed. Have a wonderful and blessed day for you and your family!
To reply, leave a comment here and begin it with {{Re|SunDawn}}
. Please remember to sign your reply with ~~~~
. (Message delivered via the
Page Curation tool, on behalf of the reviewer.)
✠ SunDawn ✠ (contact) 15:41, 19 April 2024 (UTC)
Hello, Erel Segal. It has been over six months since you last edited the Articles for Creation submission or draft page you started, " Random utility model".
In accordance with our policy that Wikipedia is not for the indefinite hosting of material, the draft has been deleted. When you plan on working on it further and you wish to retrieve it, you can request its undeletion. An administrator will, in most cases, restore the submission so you can continue to work on it.
Thank you for your submission to Wikipedia, and happy editing. ✗ plicit 05:44, 11 May 2024 (UTC)
The article will be discussed at Wikipedia:Articles for deletion/Burr dilemma until a consensus is reached, and anyone, including you, is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on high-quality evidence and our policies and guidelines.
Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article until the discussion has finished.