Main public logs
This is a combined display of all logs except the patrol, review, tag and thanks logs:
- Who performed the action – enter their name without prefix under "Performer".
- The page or user affected by an action – enter the page or user name (prefixed with "User:") under "Target".
- 13:06, 22 September 2024 Erel Segal talk contribs created page Chebyshev set (←Redirected page to Metric projection) Tags: New redirect Visual edit Uncategorized redirect
- 10:11, 16 September 2024 Erel Segal talk contribs created page Star shape set (←Redirected page to Star domain) Tags: New redirect Visual edit Uncategorized redirect
- 06:56, 16 September 2024 Erel Segal talk contribs created page Star-shaped preferences (←Created page with 'In economics, '''star-shaped preferences'''<ref>{{Cite journal |last=Border |first=Kim C. |last2=Jordan |first2=J. S. |date=1983 |title=Straightforward Elections, Unanimity and Phantom Voters |url=https://www.jstor.org/stable/2296962 |journal=The Review of Economic Studies |volume=50 |issue=1 |pages=153–170 |doi=10.2307/2296962 |issn=0034-6527}}</ref> are a class of preferences {{Under construction|placedby=Erel Segal}} Cate...') Tag: Visual edit
- 14:13, 29 August 2024 Erel Segal talk contribs created page Maximum mean weight cycle (←Redirected page to Minimum mean weight cycle) Tags: New redirect Visual edit Uncategorized redirect
- 06:15, 25 August 2024 Erel Segal talk contribs created page Parametric shortest path algorithm (←Redirected page to Shortest path problem) Tags: New redirect Visual edit Uncategorized redirect
- 06:10, 25 August 2024 Erel Segal talk contribs created page Minimum mean weight cycle (←Created page with 'In graph theory, a '''minimum mean weight cycle''' is a cycle whose average weight (total weight divided by length) is smallest among all cycles in the graph.<ref name=":0">{{Cite journal |last=Karp |first=Richard M. |date=1978-01-01 |title=A characterization of the minimum cycle mean in a digraph |url=https://www.sciencedirect.com/science/article/pii/0012365X78900110 |journal=Discrete Mathematics |volume=23 |issue=3 |pages=309...') Tag: Visual edit
- 09:36, 22 July 2024 Erel Segal talk contribs moved page Geometric discrepancy theory to Geometric discrepancy (shorter name)
- 09:29, 22 July 2024 Erel Segal talk contribs created page Discrepancy of permutations (←Created page with ''''Discrepancy of permutations''' is a sub-field of discrepancy theory, that deals with balancing intervals induced by permutations of elements. There is a set of ''n'' elements, and there are m different permutations on this set. The general research question is: can we color each element in one of two different colors (e.g. black and white), such that in each permutation, every interval contains roughly the same number of elements of each color? For...') Tags: nowiki added Visual edit
- 08:51, 22 July 2024 Erel Segal talk contribs created page Primal shatter function (←Redirected page to Shattered set) Tags: New redirect Visual edit Uncategorized redirect
- 18:00, 21 July 2024 Erel Segal talk contribs created page Combinatorial discrepancy (←Redirected page to Discrepancy of hypergraphs) Tags: New redirect Visual edit Uncategorized redirect
- 12:23, 21 July 2024 Erel Segal talk contribs created page Geometric discrepancy theory (←Created page with ''''Geometric discrepancy theory'''<ref>{{cite book |last=Matoušek |first=Jiří |author-link=Jiří Matoušek (mathematician) |title=Geometric Discrepancy: An Illustrated Guide |publisher=Springer |year=1999 |isbn=3-540-65528-X}}</ref> is a sub-field of discrepancy theory, that deals with balancing geometric sets, such as intervals or rectangles. The general research question in this field is: given a set of points in a geometric space,...') Tag: Visual edit
- 23:39, 20 July 2024 Erel Segal talk contribs created page Volume of a simplex (←Redirected page to Simplex#Volume) Tag: New redirect
- 14:35, 16 July 2024 Erel Segal talk contribs moved protection settings from Holit attack to Attack on Holit (Holit attack moved to Attack on Holit: A clearer term: clarifies that Holit is the one which was attacked, not the one which attacked. Also, the term is more common in related media articles.)
- 14:35, 16 July 2024 Erel Segal talk contribs moved page Holit attack to Attack on Holit (A clearer term: clarifies that Holit is the one which was attacked, not the one which attacked. Also, the term is more common in related media articles.)
- 14:35, 16 July 2024 Erel Segal talk contribs moved page Talk:Holit attack to Talk:Attack on Holit (A clearer term: clarifies that Holit is the one which was attacked, not the one which attacked. Also, the term is more common in related media articles.)
- 15:16, 3 July 2024 Erel Segal talk contribs created page Draft talk:Random utility model (This page can be deleted: new section) Tag: New topic
- 11:12, 24 June 2024 Erel Segal talk contribs created page Optimal network design (←Created page with ''''Optimal network design''' is a problem in combinatorial optimization. It is an abstract representation of the problem faced by states and municipalities when they plan their road network. We are given a set of locations that we would like to connect by roads. For each two location, we have a number representing the cost of building a direct road between them. We have a fixed budget, and have to decide which roads to build with that budget. The object...') Tag: Visual edit
- 05:08, 13 June 2024 Erel Segal talk contribs created page Metric projection (←Created page with 'In mathematics, a '''metric projection''' is a function that maps each element of a metric space to the set of points nearest to that element in some fixed sub-space.<ref>{{Cite web |title=Metric projection - Encyclopedia of Mathematics |url=https://encyclopediaofmath.org/wiki/Metric_projection |access-date=2024-06-13 |website=encyclopediaofmath.org}}</ref> == References == {{Reflist}} Category:metric spaces Category:approximation theory') Tag: Visual edit
- 05:40, 24 May 2024 Erel Segal talk contribs moved page Talk:Consensus allocation to Talk:Consensus splitting (This term is more common in current research)
- 05:40, 24 May 2024 Erel Segal talk contribs moved page Consensus allocation to Consensus splitting (This term is more common in current research)
- 05:39, 24 May 2024 Erel Segal talk contribs moved page Talk:Exact division to Talk:Consensus allocation (This term is more common in current research)
- 05:39, 24 May 2024 Erel Segal talk contribs moved page Exact division to Consensus allocation (This term is more common in current research)
- 10:00, 20 May 2024 Erel Segal talk contribs created page Paddable language (←Redirected page to Berman–Hartmanis conjecture) Tags: New redirect Visual edit Uncategorized redirect
- 13:15, 31 March 2024 Erel Segal talk contribs created page Compositional game theory (←Created page with ''''Compositional game theory''' is a branch of game theory and computer science, which aims to present large complex games as a composition of simple small games.<ref>{{Cite journal |last=Hedges |first=Jm |date=2016-10-03 |title=Towards compositional game theory |url=https://qmro.qmul.ac.uk/xmlui/handle/123456789/23259 |language=en}}</ref><ref>{{Cite journal |last=Ghani |first=Neil |last2=Hedges |first2=Jules |last3=Winschel |first3=Viktor |last4=Za...') Tag: Visual edit
- 09:43, 19 March 2024 Erel Segal talk contribs created page Well-described polyhedron (←Redirected page to N-dimensional polyhedron#welldescribed) Tags: New redirect Visual edit
- 11:37, 14 March 2024 Erel Segal talk contribs moved page Arrow-Debrew exchange market to Arrow-Debreu exchange market (Misspelled)
- 11:37, 14 March 2024 Erel Segal talk contribs created page Arrow–Debreu market (←Created page with 'The term '''Arrow-Debreu market''' can refer to two closely related economic models: * Arrow–Debreu model - a general market model, in which there are households (that can be both buyers and sellers) and producers. * Arrow-Debreu exchange market - a special case in which there are only households - no producers. {{Disambiguation}}') Tag: Visual edit
- 11:37, 14 March 2024 Erel Segal talk contribs created page Arrow-Debrew exchange market (←Created page with '{{Distinguish|Exchange (organized market)}} In theoretical economics, an '''Arrow-Debreu exchange market''' is a special case of the Arrow-Debreu model in which there is no production - there is only an exchange of already-existing goods. It is a generalization of the Fisher market. An Arrow-Debreu exchange market has the following ingredients: * A set of <math>m</math> divisible products. * A set of <math>n</math> agents. * Each agent <math>i...') Tag: Visual edit
- 20:44, 21 February 2024 Erel Segal talk contribs created page Random two-sided matching (←Created page with ' A '''random two-sided matching''' is a process by which members of two groups are matched to each other in a random way. It is often used in sports in order to match teams in knock-out tournaments. In this context, it is often called a '''draw''', as it is implemented by drawing balls at random from a bowl, each ball representing the name of a team. == Examples == === The UEFA Champions League draw === An example of a random two-...') Tag: Visual edit
- 08:17, 9 February 2024 Erel Segal talk contribs created page Fractional spanning tree (←Redirected page to Minimum spanning tree#fractional) Tags: New redirect Visual edit
- 08:15, 9 February 2024 Erel Segal talk contribs created page Category:Fractional graph theory (←Created page with 'Category:Graph theory') Tag: Visual edit
- 15:52, 30 January 2024 Erel Segal talk contribs created page Representation complexity (←Redirected page to N-dimensional polyhedron#facetcomplexity) Tags: New redirect Visual edit
- 13:54, 30 January 2024 Erel Segal talk contribs created page Vertex complexity (←Redirected page to N-dimensional polyhedron#vertexcomplexity) Tags: New redirect Visual edit
- 13:53, 30 January 2024 Erel Segal talk contribs created page Facet complexity (←Redirected page to N-dimensional polyhedron#facetcomplexity) Tags: New redirect Visual edit
- 13:29, 30 January 2024 Erel Segal talk contribs created page Simultaneous diophantine approximation (←Redirected page to Diophantine approximation) Tags: New redirect Visual edit
- 12:22, 30 January 2024 Erel Segal talk contribs created page N-dimensional polyhedron (Move some stuff from polyhedron) Tag: Visual edit
- 18:07, 29 January 2024 Erel Segal talk contribs created page Central-cut ellipsoid method (←Redirected page to Ellipsoid method#Variants) Tags: New redirect Visual edit
- 17:55, 29 January 2024 Erel Segal talk contribs created page Shallow-cut ellipsoid method (←Redirected page to Ellipsoid method) Tags: New redirect Visual edit
- 14:18, 28 January 2024 Erel Segal talk contribs created page Algorithmic problems on convex sets (←Created page with 'Many problems in mathematical programming can be formulated as '''problems on convex set<nowiki/>s''' or convex bodies. Six kinds of problems are particularly important:<ref name=":0">{{Cite Geometric Algorithms and Combinatorial Optimization}}</ref>{{Rp|page=|location=Sec.2}} '''optimization''', '''violation''', '''validity''', '''separation''', '''membership''' and '''emptiness'''. Each of these problems has a strong (exact) varian...') Tags: nowiki added Visual edit
- 13:37, 28 January 2024 Erel Segal talk contribs created page Strongly-polynomial time (←Redirected page to Strongly polynomial) Tags: New redirect Visual edit
- 13:31, 28 January 2024 Erel Segal talk contribs created page Motzkin elimination (←Redirected page to Fourier–Motzkin elimination) Tags: New redirect Visual edit
- 12:40, 28 January 2024 Erel Segal talk contribs created page Arithmetic model of computation (Is this the right redirect?) Tags: New redirect Visual edit
- 11:06, 28 January 2024 Erel Segal talk contribs created page Template:Cite Geometric Algorithms and Combinatorial Optimization (←Created page with '{{citation | last1 = Grötschel | first1 = Martin | author1-link = Martin Grötschel | last2 = Lovász | first2 = László | author2-link = László Lovász | last3 = Schrijver | first3 = Alexander | author3-link = Alexander Schrijver | doi = 10.1007/978-3-642-78240-4 | edition = 2nd | isbn = 3-642-78242-8 | mr = 1261419 | publisher = Springer-Verlag, Berlin | series = Algorithms and Combinatorics | title = Geometric algorithms and combinatorial o...')
- 11:42, 24 January 2024 Erel Segal talk contribs created page Steinhaus chessboard theorem (←Created page with 'The Steinhaus chessboard theorem is the following theorem, due to Hugo Steinhaus:<ref>{{Cite journal |last=Kulpa |first=Władysław |last2=Socha |first2=Lesƚaw |last3=Turzański |first3=Marian |date=2000 |title=Steinhaus chessboard theorem |url=https://eudml.org/doc/196842 |journal=Acta Universitatis Carolinae. Mathematica et Physica |volume=041 |issue=2 |pages=47–50 |issn=0001-7140}}</ref><blockquote>Consider a chessboard on which some cells con...') Tag: Visual edit
- 11:24, 24 January 2024 Erel Segal talk contribs created page Miranda theorem (←Redirected page to Poincaré–Miranda theorem) Tags: New redirect Visual edit
- 20:10, 15 January 2024 Erel Segal talk contribs created page Regret-free truth-telling (←Redirected page to Regret-free mechanism) Tags: New redirect Visual edit
- 11:30, 1 January 2024 Erel Segal talk contribs created page Square-root sum problem (start) Tag: Visual edit
- 10:58, 1 January 2024 Erel Segal talk contribs moved page Talk:Square Roots to Talk:Square Roots festival (Better differentiation from the mathematical concept)
- 10:58, 1 January 2024 Erel Segal talk contribs moved page Square Roots to Square Roots festival (Better differentiation from the mathematical concept)
- 17:55, 31 December 2023 Erel Segal talk contribs created page Spectraplex (←Redirected page to Spectrahedron) Tags: New redirect Visual edit