[{"data":1,"prerenderedAt":448},["ShallowReactive",2],{"project:cyclic-group-zerosum-factor":3,"catalog":31},{"slug":4,"name":5,"nameHtml":5,"summary":6,"summaryHtml":6,"authors":7,"searchText":11,"facets":12,"source":25,"descriptionHtml":27,"bibliographyHtml":28,"funding":29,"affiliations":30},"cyclic-group-zerosum-factor","Exhaustive Search for Minimal Factorizations of Zero-Sum Sequences in Cyclic Groups","A multithreaded Rust program for exhaustive searches for factorizations into four minimal zero-sum sequences in cyclic groups of even order.",[8],{"name":9,"orcid":10,"html":9},"Benjamin Hackl","https:\u002F\u002Forcid.org\u002F0000-0003-2998-9599","exhaustive search for minimal factorizations of zero-sum sequences in cyclic groups a multithreaded rust program for exhaustive searches for factorizations into four minimal zero-sum sequences in cyclic groups of even order. benjamin hackl this rust program, distributed as cyclic-group-zerosum-factor , carries out exhaustive computational experiments on zero-sum sequences in cyclic groups of even order c_{2n} . for selected generators a,b,c , it investigates whether a sequence of the form u = a^{2n}b^{2n}c^{2n} = u_1u_2u_3u_4 admits a factorization into four non-empty minimal zero-sum sequences. candidate factorizations are enumerated through products of weak integer compositions, with batches of candidates distributed to worker threads. the zenodo archive includes the rust source, cargo metadata, and a readme with the mathematical formulation, implementation notes, and experimental results. the command cargo run --release -- \u003Cn> selects the group order 2n . this is a standalone program, separate from the zero-sum-sequences python package. the license recorded for the deposited software is cc by 4.0.",{"tags":13,"audiences":17,"affiliations":19,"license":20,"maintenance":22,"resources":24},[14,15,16],"additive combinatorics","factorization theory","exhaustive search",[18],"research",[],[21],"CC-BY-4.0",[23],"unspecified",[],{"doi":26},"10.5281\u002Fzenodo.15676314","\u003Cp>This Rust program, distributed as \u003Ccode>cyclic-group-zerosum-factor\u003C\u002Fcode>, carries out\nexhaustive computational experiments on zero-sum sequences in cyclic groups of\neven order \u003Cmjx-container class=\"MathJax\" jax=\"SVG\" overflow=\"overflow\">\u003Csvg aria-label=\"C_{2n}\" style=\"vertical-align: -0.357ex;\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" width=\"3.565ex\" height=\"1.952ex\" role=\"img\" focusable=\"false\" viewBox=\"0 -705 1575.8 862.8\">\u003Cg stroke=\"currentColor\" fill=\"currentColor\" stroke-width=\"0\" transform=\"scale(1,-1)\">\u003Cg data-mml-node=\"math\" data-latex=\"C_{2n}\">\u003Cg data-mml-node=\"msub\" data-latex=\"C_{2n}\">\u003Cg data-mml-node=\"mi\" data-latex=\"C\">\u003Cpath data-c=\"1D436\" d=\"M148 218C148 346 204 476 267 548C318 607 406 666 505 666C609 666 660 587 660 479C660 470 657 438 657 429C657 420 663 415 676 415C681 415 685 416 688 417C693 424 696 431 698 438L760 691C760 700 755 705 745 705C741 705 735 701 727 692L662 619C623 676 568 705 497 705C442 705 388 692 333 667C222 615 141 533 89 421C63 366 50 310 50 253C50 173 75 108 126 56C177 4 242-22 322-22C401-22 473 7 538 64C565 87 588 115 607 146C634 191 648 222 648 241C648 250 643 255 632 255C623 255 618 251 616 242C595 177 562 125 517 88C460 41 400 17 338 17C218 17 148 98 148 218Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"TeXAtom\" transform=\"translate(748,-150) scale(0.707)\" data-latex=\"{2n}\" data-mjx-texclass=\"ORD\">\u003Cg data-mml-node=\"mn\" data-latex=\"2\">\u003Cpath data-c=\"32\" d=\"M237 666C186 666 143 648 106 612C69 576 50 534 50 483C50 449 75 424 106 424C136 424 161 450 161 480C161 513 137 536 105 536C102 536 100 536 98 535C117 584 161 627 224 627C306 627 352 556 352 470C352 403 318 331 250 255L62 43C49 28 50 29 50 0L421 0L450 180L417 180C409 129 402 100 396 91C391 86 361 84 306 84L139 84L236 179C304 243 390 312 419 365C439 400 449 435 449 470C449 588 357 666 237 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mi\" data-latex=\"n\" transform=\"translate(500,0)\">\u003Cpath data-c=\"1D45B\" d=\"M537 137C514 58 481 18 440 18C427 18 420 28 420 47C420 61 426 84 438 115C478 224 498 296 498 333C498 403 451 442 381 442C322 442 271 416 230 363C222 407 187 442 136 442C80 442 58 390 44 345C34 313 29 294 29 287C29 278 34 273 45 273C50 273 53 274 56 276C61 285 64 292 65 299C83 375 106 413 133 413C151 413 160 399 160 371C160 358 155 331 144 290L87 63C84 50 78 24 78 19C78-1 89-11 111-11C130-11 144-1 151 19C153 24 159 49 170 92L191 181L221 295C232 318 249 341 270 365C299 397 335 413 378 413C411 413 427 391 427 348C427 310 406 234 363 120C356 102 353 87 353 74C353 25 390-11 438-11C482-11 517 14 542 64C561 104 571 131 571 144C571 153 566 158 555 158C552 158 537 149 537 137Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003C\u002Fmjx-container>.\u003C\u002Fp>\n\u003Cp>For selected generators \u003Cmjx-container class=\"MathJax\" jax=\"SVG\" overflow=\"overflow\">\u003Csvg aria-label=\"a,b,c\" style=\"vertical-align: -0.437ex;\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" width=\"5.159ex\" height=\"2.007ex\" role=\"img\" focusable=\"false\" viewBox=\"0 -694 2280.3 887\">\u003Cg stroke=\"currentColor\" fill=\"currentColor\" stroke-width=\"0\" transform=\"scale(1,-1)\">\u003Cg data-mml-node=\"math\" data-latex=\"a,b,c\">\u003Cg data-mml-node=\"mi\" data-latex=\"a\">\u003Cpath data-c=\"1D44E\" d=\"M498 144C498 153 493 158 482 158C474 158 468 151 465 137C445 58 421 18 394 18C377 18 368 32 368 60C368 73 372 97 381 132L438 357C443 376 445 387 445 392C445 412 434 422 412 422C391 422 377 410 370 387C349 424 319 442 281 442C216 442 159 409 109 343C63 281 40 217 40 150C40 63 91-11 175-11C218-11 260 12 300 58C311 20 345-11 392-11C461-11 482 70 498 144M341 374C350 353 355 339 355 330C355 326 354 321 353 314L304 122C301 111 294 99 285 87C248 41 212 18 177 18C138 18 118 48 118 107C118 131 124 167 136 215C157 300 187 357 224 388C244 405 263 413 282 413C309 413 329 400 341 374Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mo\" data-latex=\",\" transform=\"translate(529,0)\">\u003Cpath data-c=\"2C\" d=\"M139 106C107 106 86 82 86 50C86 20 109-5 139-5C153-5 165-1 174 8L175 0C175-63 154-117 112-160C105-168 101-174 101-178C101-188 105-193 114-193C123-193 135-181 152-158C186-110 203-57 203 0C203 53 185 106 139 106Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mi\" data-latex=\"b\" transform=\"translate(973.7,0)\">\u003Cpath data-c=\"1D44F\" d=\"M281 445C245 445 209 428 174 394L243 679C241 688 238 694 226 694C193 694 120 685 107 684C92 682 84 675 84 660C84 650 93 645 112 645C131 645 157 646 157 632C157 628 152 608 143 571L63 249C52 207 47 173 47 148C47 62 93-11 175-11C240-11 297 22 347 89C392 151 415 216 415 283C415 370 364 445 281 445M279 415C318 415 337 385 337 326C337 299 331 263 319 218C297 133 268 75 233 44C213 27 194 19 175 19C134 19 114 51 114 115C114 137 119 170 129 214L151 304C154 319 159 330 165 338C204 389 242 415 279 415Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mo\" data-latex=\",\" transform=\"translate(1402.7,0)\">\u003Cpath data-c=\"2C\" d=\"M139 106C107 106 86 82 86 50C86 20 109-5 139-5C153-5 165-1 174 8L175 0C175-63 154-117 112-160C105-168 101-174 101-178C101-188 105-193 114-193C123-193 135-181 152-158C186-110 203-57 203 0C203 53 185 106 139 106Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mi\" data-latex=\"c\" transform=\"translate(1847.3,0)\">\u003Cpath data-c=\"1D450\" d=\"M328 325C328 300 341 287 368 287C404 287 427 318 427 354C427 410 368 442 308 442C239 442 176 412 122 353C68 294 41 229 41 159C41 61 106-11 204-11C257-11 304 2 345 27C379 48 404 69 420 90C427 99 430 106 430 109C430 120 425 126 414 126C409 126 404 122 398 114C365 70 324 42 277 30C246 22 223 18 206 18C149 18 121 53 121 122C121 184 150 274 174 317C198 361 249 413 308 413C346 413 372 402 386 381C355 378 328 358 328 325Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003C\u002Fmjx-container>, it investigates whether a sequence of the form\u003C\u002Fp>\n\u003Cmjx-container class=\"MathJax\" jax=\"SVG\" overflow=\"overflow\" display=\"true\">\u003Csvg aria-label=\"U = a^{2n}b^{2n}c^{2n} = U_1U_2U_3U_4\" style=\"vertical-align: -0.375ex;\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" width=\"26.875ex\" height=\"2.374ex\" role=\"img\" focusable=\"false\" viewBox=\"0 -883.9 11878.8 1049.5\">\u003Cg stroke=\"currentColor\" fill=\"currentColor\" stroke-width=\"0\" transform=\"scale(1,-1)\">\u003Cg data-mml-node=\"math\" data-latex=\"U = a^{2n}b^{2n}c^{2n} = U_1U_2U_3U_4\">\u003Cg data-mml-node=\"mi\" data-latex=\"U\">\u003Cpath data-c=\"1D448\" d=\"M642 680C623 680 559 683 540 683C525 683 518 675 518 659C518 650 525 645 539 644C582 644 603 631 603 605C603 599 602 592 600 585L511 232C496 175 467 126 424 84C377 39 325 17 269 17C195 17 152 67 152 141L153 150C153 169 156 191 163 217L259 602C264 623 273 636 286 641C292 643 309 644 338 644C364 644 375 644 375 668C375 678 369 683 358 683L231 680L104 683C88 683 81 674 81 659C81 652 84 647 89 646C99 645 107 644 112 644C143 643 161 641 166 640C171 639 173 636 173 631C173 629 172 622 169 611L74 230C69 211 67 192 67 172C67 57 150-22 265-22C330-22 390 3 445 54C498 102 532 158 548 223L636 574C649 625 677 643 739 644C753 645 760 653 760 668L760 672C757 679 752 683 743 683C724 683 661 680 642 680Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mo\" data-latex=\"=\" transform=\"translate(1037.8,0)\">\u003Cpath data-c=\"3D\" d=\"M698 367L80 367C64 367 56 359 56 344C56 329 64 321 80 321L698 321C714 321 722 329 722 344C722 356 711 367 698 367M698 179L80 179C64 179 56 171 56 156C56 141 64 133 80 133L698 133C714 133 722 141 722 156C722 169 711 179 698 179Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"msup\" data-latex=\"a^{2n}\" transform=\"translate(2093.6,0)\">\u003Cg data-mml-node=\"mi\" data-latex=\"a\">\u003Cpath data-c=\"1D44E\" d=\"M498 144C498 153 493 158 482 158C474 158 468 151 465 137C445 58 421 18 394 18C377 18 368 32 368 60C368 73 372 97 381 132L438 357C443 376 445 387 445 392C445 412 434 422 412 422C391 422 377 410 370 387C349 424 319 442 281 442C216 442 159 409 109 343C63 281 40 217 40 150C40 63 91-11 175-11C218-11 260 12 300 58C311 20 345-11 392-11C461-11 482 70 498 144M341 374C350 353 355 339 355 330C355 326 354 321 353 314L304 122C301 111 294 99 285 87C248 41 212 18 177 18C138 18 118 48 118 107C118 131 124 167 136 215C157 300 187 357 224 388C244 405 263 413 282 413C309 413 329 400 341 374Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"TeXAtom\" transform=\"translate(562,413) scale(0.707)\" data-latex=\"{2n}\" data-mjx-texclass=\"ORD\">\u003Cg data-mml-node=\"mn\" data-latex=\"2\">\u003Cpath data-c=\"32\" d=\"M237 666C186 666 143 648 106 612C69 576 50 534 50 483C50 449 75 424 106 424C136 424 161 450 161 480C161 513 137 536 105 536C102 536 100 536 98 535C117 584 161 627 224 627C306 627 352 556 352 470C352 403 318 331 250 255L62 43C49 28 50 29 50 0L421 0L450 180L417 180C409 129 402 100 396 91C391 86 361 84 306 84L139 84L236 179C304 243 390 312 419 365C439 400 449 435 449 470C449 588 357 666 237 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mi\" data-latex=\"n\" transform=\"translate(500,0)\">\u003Cpath data-c=\"1D45B\" d=\"M537 137C514 58 481 18 440 18C427 18 420 28 420 47C420 61 426 84 438 115C478 224 498 296 498 333C498 403 451 442 381 442C322 442 271 416 230 363C222 407 187 442 136 442C80 442 58 390 44 345C34 313 29 294 29 287C29 278 34 273 45 273C50 273 53 274 56 276C61 285 64 292 65 299C83 375 106 413 133 413C151 413 160 399 160 371C160 358 155 331 144 290L87 63C84 50 78 24 78 19C78-1 89-11 111-11C130-11 144-1 151 19C153 24 159 49 170 92L191 181L221 295C232 318 249 341 270 365C299 397 335 413 378 413C411 413 427 391 427 348C427 310 406 234 363 120C356 102 353 87 353 74C353 25 390-11 438-11C482-11 517 14 542 64C561 104 571 131 571 144C571 153 566 158 555 158C552 158 537 149 537 137Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg data-mml-node=\"msup\" data-latex=\"b^{2n}\" transform=\"translate(3483.4,0)\">\u003Cg data-mml-node=\"mi\" data-latex=\"b\">\u003Cpath data-c=\"1D44F\" d=\"M281 445C245 445 209 428 174 394L243 679C241 688 238 694 226 694C193 694 120 685 107 684C92 682 84 675 84 660C84 650 93 645 112 645C131 645 157 646 157 632C157 628 152 608 143 571L63 249C52 207 47 173 47 148C47 62 93-11 175-11C240-11 297 22 347 89C392 151 415 216 415 283C415 370 364 445 281 445M279 415C318 415 337 385 337 326C337 299 331 263 319 218C297 133 268 75 233 44C213 27 194 19 175 19C134 19 114 51 114 115C114 137 119 170 129 214L151 304C154 319 159 330 165 338C204 389 242 415 279 415Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"TeXAtom\" transform=\"translate(462,413) scale(0.707)\" data-latex=\"{2n}\" data-mjx-texclass=\"ORD\">\u003Cg data-mml-node=\"mn\" data-latex=\"2\">\u003Cpath data-c=\"32\" d=\"M237 666C186 666 143 648 106 612C69 576 50 534 50 483C50 449 75 424 106 424C136 424 161 450 161 480C161 513 137 536 105 536C102 536 100 536 98 535C117 584 161 627 224 627C306 627 352 556 352 470C352 403 318 331 250 255L62 43C49 28 50 29 50 0L421 0L450 180L417 180C409 129 402 100 396 91C391 86 361 84 306 84L139 84L236 179C304 243 390 312 419 365C439 400 449 435 449 470C449 588 357 666 237 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mi\" data-latex=\"n\" transform=\"translate(500,0)\">\u003Cpath data-c=\"1D45B\" d=\"M537 137C514 58 481 18 440 18C427 18 420 28 420 47C420 61 426 84 438 115C478 224 498 296 498 333C498 403 451 442 381 442C322 442 271 416 230 363C222 407 187 442 136 442C80 442 58 390 44 345C34 313 29 294 29 287C29 278 34 273 45 273C50 273 53 274 56 276C61 285 64 292 65 299C83 375 106 413 133 413C151 413 160 399 160 371C160 358 155 331 144 290L87 63C84 50 78 24 78 19C78-1 89-11 111-11C130-11 144-1 151 19C153 24 159 49 170 92L191 181L221 295C232 318 249 341 270 365C299 397 335 413 378 413C411 413 427 391 427 348C427 310 406 234 363 120C356 102 353 87 353 74C353 25 390-11 438-11C482-11 517 14 542 64C561 104 571 131 571 144C571 153 566 158 555 158C552 158 537 149 537 137Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg data-mml-node=\"msup\" data-latex=\"c^{2n}\" transform=\"translate(4773.2,0)\">\u003Cg data-mml-node=\"mi\" data-latex=\"c\">\u003Cpath data-c=\"1D450\" d=\"M328 325C328 300 341 287 368 287C404 287 427 318 427 354C427 410 368 442 308 442C239 442 176 412 122 353C68 294 41 229 41 159C41 61 106-11 204-11C257-11 304 2 345 27C379 48 404 69 420 90C427 99 430 106 430 109C430 120 425 126 414 126C409 126 404 122 398 114C365 70 324 42 277 30C246 22 223 18 206 18C149 18 121 53 121 122C121 184 150 274 174 317C198 361 249 413 308 413C346 413 372 402 386 381C355 378 328 358 328 325Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"TeXAtom\" transform=\"translate(466,413) scale(0.707)\" data-latex=\"{2n}\" data-mjx-texclass=\"ORD\">\u003Cg data-mml-node=\"mn\" data-latex=\"2\">\u003Cpath data-c=\"32\" d=\"M237 666C186 666 143 648 106 612C69 576 50 534 50 483C50 449 75 424 106 424C136 424 161 450 161 480C161 513 137 536 105 536C102 536 100 536 98 535C117 584 161 627 224 627C306 627 352 556 352 470C352 403 318 331 250 255L62 43C49 28 50 29 50 0L421 0L450 180L417 180C409 129 402 100 396 91C391 86 361 84 306 84L139 84L236 179C304 243 390 312 419 365C439 400 449 435 449 470C449 588 357 666 237 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mi\" data-latex=\"n\" transform=\"translate(500,0)\">\u003Cpath data-c=\"1D45B\" d=\"M537 137C514 58 481 18 440 18C427 18 420 28 420 47C420 61 426 84 438 115C478 224 498 296 498 333C498 403 451 442 381 442C322 442 271 416 230 363C222 407 187 442 136 442C80 442 58 390 44 345C34 313 29 294 29 287C29 278 34 273 45 273C50 273 53 274 56 276C61 285 64 292 65 299C83 375 106 413 133 413C151 413 160 399 160 371C160 358 155 331 144 290L87 63C84 50 78 24 78 19C78-1 89-11 111-11C130-11 144-1 151 19C153 24 159 49 170 92L191 181L221 295C232 318 249 341 270 365C299 397 335 413 378 413C411 413 427 391 427 348C427 310 406 234 363 120C356 102 353 87 353 74C353 25 390-11 438-11C482-11 517 14 542 64C561 104 571 131 571 144C571 153 566 158 555 158C552 158 537 149 537 137Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003Cg data-mml-node=\"mo\" data-latex=\"=\" transform=\"translate(6344.8,0)\">\u003Cpath data-c=\"3D\" d=\"M698 367L80 367C64 367 56 359 56 344C56 329 64 321 80 321L698 321C714 321 722 329 722 344C722 356 711 367 698 367M698 179L80 179C64 179 56 171 56 156C56 141 64 133 80 133L698 133C714 133 722 141 722 156C722 169 711 179 698 179Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"msub\" data-latex=\"U_1\" transform=\"translate(7400.6,0)\">\u003Cg data-mml-node=\"mi\" data-latex=\"U\">\u003Cpath data-c=\"1D448\" d=\"M642 680C623 680 559 683 540 683C525 683 518 675 518 659C518 650 525 645 539 644C582 644 603 631 603 605C603 599 602 592 600 585L511 232C496 175 467 126 424 84C377 39 325 17 269 17C195 17 152 67 152 141L153 150C153 169 156 191 163 217L259 602C264 623 273 636 286 641C292 643 309 644 338 644C364 644 375 644 375 668C375 678 369 683 358 683L231 680L104 683C88 683 81 674 81 659C81 652 84 647 89 646C99 645 107 644 112 644C143 643 161 641 166 640C171 639 173 636 173 631C173 629 172 622 169 611L74 230C69 211 67 192 67 172C67 57 150-22 265-22C330-22 390 3 445 54C498 102 532 158 548 223L636 574C649 625 677 643 739 644C753 645 760 653 760 668L760 672C757 679 752 683 743 683C724 683 661 680 642 680Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mn\" transform=\"translate(716,-150) scale(0.707)\" data-latex=\"1\">\u003Cpath data-c=\"31\" d=\"M269 666C228 624 168 603 89 603L89 564C141 564 184 572 217 588L217 82C217 64 213 52 204 47C195 42 170 39 130 39L95 39L95 0C120 2 174 3 257 3C340 3 394 2 419 0L419 39L384 39C343 39 318 42 310 47C302 52 297 64 297 82L297 636C297 660 295 666 269 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003Cg data-mml-node=\"msub\" data-latex=\"U_2\" transform=\"translate(8520.1,0)\">\u003Cg data-mml-node=\"mi\" data-latex=\"U\">\u003Cpath data-c=\"1D448\" d=\"M642 680C623 680 559 683 540 683C525 683 518 675 518 659C518 650 525 645 539 644C582 644 603 631 603 605C603 599 602 592 600 585L511 232C496 175 467 126 424 84C377 39 325 17 269 17C195 17 152 67 152 141L153 150C153 169 156 191 163 217L259 602C264 623 273 636 286 641C292 643 309 644 338 644C364 644 375 644 375 668C375 678 369 683 358 683L231 680L104 683C88 683 81 674 81 659C81 652 84 647 89 646C99 645 107 644 112 644C143 643 161 641 166 640C171 639 173 636 173 631C173 629 172 622 169 611L74 230C69 211 67 192 67 172C67 57 150-22 265-22C330-22 390 3 445 54C498 102 532 158 548 223L636 574C649 625 677 643 739 644C753 645 760 653 760 668L760 672C757 679 752 683 743 683C724 683 661 680 642 680Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mn\" transform=\"translate(716,-150) scale(0.707)\" data-latex=\"2\">\u003Cpath data-c=\"32\" d=\"M237 666C186 666 143 648 106 612C69 576 50 534 50 483C50 449 75 424 106 424C136 424 161 450 161 480C161 513 137 536 105 536C102 536 100 536 98 535C117 584 161 627 224 627C306 627 352 556 352 470C352 403 318 331 250 255L62 43C49 28 50 29 50 0L421 0L450 180L417 180C409 129 402 100 396 91C391 86 361 84 306 84L139 84L236 179C304 243 390 312 419 365C439 400 449 435 449 470C449 588 357 666 237 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003Cg data-mml-node=\"msub\" data-latex=\"U_3\" transform=\"translate(9639.7,0)\">\u003Cg data-mml-node=\"mi\" data-latex=\"U\">\u003Cpath data-c=\"1D448\" d=\"M642 680C623 680 559 683 540 683C525 683 518 675 518 659C518 650 525 645 539 644C582 644 603 631 603 605C603 599 602 592 600 585L511 232C496 175 467 126 424 84C377 39 325 17 269 17C195 17 152 67 152 141L153 150C153 169 156 191 163 217L259 602C264 623 273 636 286 641C292 643 309 644 338 644C364 644 375 644 375 668C375 678 369 683 358 683L231 680L104 683C88 683 81 674 81 659C81 652 84 647 89 646C99 645 107 644 112 644C143 643 161 641 166 640C171 639 173 636 173 631C173 629 172 622 169 611L74 230C69 211 67 192 67 172C67 57 150-22 265-22C330-22 390 3 445 54C498 102 532 158 548 223L636 574C649 625 677 643 739 644C753 645 760 653 760 668L760 672C757 679 752 683 743 683C724 683 661 680 642 680Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mn\" transform=\"translate(716,-150) scale(0.707)\" data-latex=\"3\">\u003Cpath data-c=\"33\" d=\"M303 353C369 378 431 441 431 526C431 569 410 604 369 631C333 654 292 666 246 666C201 666 162 654 127 631C88 605 68 571 68 528C68 495 90 472 122 472C154 472 176 495 176 527C176 560 157 578 119 580C145 615 186 633 242 633C302 633 332 598 332 527C332 485 324 450 309 421C282 373 245 364 183 364C171 362 165 357 165 348C165 333 172 333 192 333L235 333C310 333 348 280 348 173C348 88 317 14 241 14C176 14 128 36 99 80C134 79 160 105 160 139C160 173 135 198 101 198C62 198 42 178 42 137C42 88 64 49 108 18C147-9 193-22 244-22C301-22 350-3 393 34C436 71 457 117 457 173C457 267 383 332 303 353Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003Cg data-mml-node=\"msub\" data-latex=\"U_4\" transform=\"translate(10759.2,0)\">\u003Cg data-mml-node=\"mi\" data-latex=\"U\">\u003Cpath data-c=\"1D448\" d=\"M642 680C623 680 559 683 540 683C525 683 518 675 518 659C518 650 525 645 539 644C582 644 603 631 603 605C603 599 602 592 600 585L511 232C496 175 467 126 424 84C377 39 325 17 269 17C195 17 152 67 152 141L153 150C153 169 156 191 163 217L259 602C264 623 273 636 286 641C292 643 309 644 338 644C364 644 375 644 375 668C375 678 369 683 358 683L231 680L104 683C88 683 81 674 81 659C81 652 84 647 89 646C99 645 107 644 112 644C143 643 161 641 166 640C171 639 173 636 173 631C173 629 172 622 169 611L74 230C69 211 67 192 67 172C67 57 150-22 265-22C330-22 390 3 445 54C498 102 532 158 548 223L636 574C649 625 677 643 739 644C753 645 760 653 760 668L760 672C757 679 752 683 743 683C724 683 661 680 642 680Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mn\" transform=\"translate(716,-150) scale(0.707)\" data-latex=\"4\">\u003Cpath data-c=\"34\" d=\"M353 677C344 677 336 672 330 663L28 199L28 163L289 163L289 81C289 63 285 51 278 46C271 41 252 39 219 39L194 39L194 0C223 2 269 3 331 3C393 3 439 2 468 0L468 39L443 39C410 39 391 41 384 46C377 51 373 63 373 81L373 163L471 163L471 202L373 202L373 660C373 670 366 677 353 677M295 553L295 202L67 202Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003C\u002Fmjx-container>\n\u003Cp>admits a factorization into four non-empty minimal zero-sum sequences. Candidate\nfactorizations are enumerated through products of weak integer compositions,\nwith batches of candidates distributed to worker threads.\u003C\u002Fp>\n\u003Cp>The Zenodo archive includes the Rust source, Cargo metadata, and a README with\nthe mathematical formulation, implementation notes, and experimental results.\nThe command \u003Ccode>cargo run --release -- <n>\u003C\u002Fcode> selects the group order \u003Cmjx-container class=\"MathJax\" jax=\"SVG\" overflow=\"overflow\">\u003Csvg aria-label=\"2n\" style=\"vertical-align: -0.025ex;\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" width=\"2.489ex\" height=\"1.532ex\" role=\"img\" focusable=\"false\" viewBox=\"0 -666 1100 677\">\u003Cg stroke=\"currentColor\" fill=\"currentColor\" stroke-width=\"0\" transform=\"scale(1,-1)\">\u003Cg data-mml-node=\"math\" data-latex=\"2n\">\u003Cg data-mml-node=\"mn\" data-latex=\"2\">\u003Cpath data-c=\"32\" d=\"M237 666C186 666 143 648 106 612C69 576 50 534 50 483C50 449 75 424 106 424C136 424 161 450 161 480C161 513 137 536 105 536C102 536 100 536 98 535C117 584 161 627 224 627C306 627 352 556 352 470C352 403 318 331 250 255L62 43C49 28 50 29 50 0L421 0L450 180L417 180C409 129 402 100 396 91C391 86 361 84 306 84L139 84L236 179C304 243 390 312 419 365C439 400 449 435 449 470C449 588 357 666 237 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mi\" data-latex=\"n\" transform=\"translate(500,0)\">\u003Cpath data-c=\"1D45B\" d=\"M537 137C514 58 481 18 440 18C427 18 420 28 420 47C420 61 426 84 438 115C478 224 498 296 498 333C498 403 451 442 381 442C322 442 271 416 230 363C222 407 187 442 136 442C80 442 58 390 44 345C34 313 29 294 29 287C29 278 34 273 45 273C50 273 53 274 56 276C61 285 64 292 65 299C83 375 106 413 133 413C151 413 160 399 160 371C160 358 155 331 144 290L87 63C84 50 78 24 78 19C78-1 89-11 111-11C130-11 144-1 151 19C153 24 159 49 170 92L191 181L221 295C232 318 249 341 270 365C299 397 335 413 378 413C411 413 427 391 427 348C427 310 406 234 363 120C356 102 353 87 353 74C353 25 390-11 438-11C482-11 517 14 542 64C561 104 571 131 571 144C571 153 566 158 555 158C552 158 537 149 537 137Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003C\u002Fmjx-container>.\nThis is a standalone program, separate from the \u003Ccode>zero-sum-sequences\u003C\u002Fcode> Python\npackage.\u003C\u002Fp>\n\u003Cp>The license recorded for the deposited software is CC BY 4.0.\u003C\u002Fp>","",[],[],{"version":32,"projects":33,"facets":391},1,[34,63,80,95,116,126,144,166,185,201,220,235,258,277,298,316,331,348,378],{"slug":35,"name":36,"nameHtml":36,"summary":37,"summaryHtml":37,"authors":38,"searchText":49,"facets":50},"avionic","AVIONIC","GPU-accelerated variational reconstruction of undersampled dynamic MRI data, including estimation of receiver-coil sensitivities.",[39,41,44,46],{"name":40,"html":40},"Andreas Schwarzl",{"name":42,"orcid":43,"html":42},"Martin Holler","https:\u002F\u002Forcid.org\u002F0000-0002-2895-2375",{"name":45,"html":45},"Matthias Schloegl",{"name":47,"orcid":48,"html":47},"Kristian Bredies","https:\u002F\u002Forcid.org\u002F0000-0001-7140-043X","avionic gpu-accelerated variational reconstruction of undersampled dynamic mri data, including estimation of receiver-coil sensitivities. andreas schwarzl martin holler matthias schloegl kristian bredies avionic — accelerated variational dynamic mri reconstruction implements gpu-accelerated reconstruction of highly undersampled dynamic magnetic resonance measurements. applications include cardiac imaging and dynamic contrast-enhanced mri. the software supports cartesian and non-cartesian sampling when the required trajectory information is available. it also includes variational estimation of receiver-coil sensitivity profiles and reconstruction methods based on infimal convolution of total generalized variation functionals. the primary repository is hosted on tu graz gitlab. the older github repository is archived and points to that location; the mirror's archival status does not imply that development of the software has ended. the readme and bundled license file give different gpl\u002Flgpl notices. consult the repository's licensing information before reuse.",{"tags":51,"audiences":56,"affiliations":57,"license":58,"maintenance":59,"resources":60},[52,53,54,55],"inverse problems","mathematical imaging","magnetic resonance imaging","GPU computing",[18],[],[23],[23],[61,62],"documentation","publications",{"slug":64,"name":65,"nameHtml":65,"summary":66,"summaryHtml":66,"authors":67,"searchText":70,"facets":71},"cellsim","CellSim","Julia simulation code for cell mechanics in confined environments, with configurable cortex, nucleus, and confinement models.",[68],{"name":69,"html":69},"Gaspard Jankowiak","cellsim julia simulation code for cell mechanics in confined environments, with configurable cortex, nucleus, and confinement models. gaspard jankowiak cellsim is a julia codebase for numerical simulations of cell mechanics. its modules represent the cell cortex, nucleus, centrosome, and confining walls, with utilities for plotting and measuring simulation results. yaml configuration files control parameters such as membrane elasticity, cortex viscosity, polymerization speed, confinement geometry, and nuclear mechanics. the repository includes configurations with and without a nucleus, parameter sweeps, and scripts for collecting and plotting metrics. this is a research simulation codebase rather than a registered julia package. the readme provides environment setup and execution instructions; users should check its dependency requirements before running the examples.",{"tags":72,"audiences":75,"affiliations":76,"license":77,"maintenance":78,"resources":79},[73,74],"mathematical biology","numerical simulation",[18],[],[23],[23],[61],{"slug":81,"name":81,"nameHtml":81,"summary":82,"summaryHtml":82,"authors":83,"searchText":85,"facets":86},"combpyter","A lightweight Python library for enumerating Dyck paths and studying their combinatorial statistics.",[84],{"name":9,"orcid":10,"html":9},"combpyter a lightweight python library for enumerating dyck paths and studying their combinatorial statistics. benjamin hackl combpyter is a lightweight python library for generating and analysing combinatorial objects. it is a personal, research-driven project with a focused scope: the documented implementation currently supports dyck paths through the dyckpath and dyckpaths interfaces. the readme demonstrates enumerating dyck paths of semilength 8 and computing the distribution of their numbers of peaks. this statistic is described by the narayana numbers n(n,k) = \\frac{1}{n}\\binom{n}{k}\\binom{n}{k-1}. the package is installable from pypi and includes tests in its source repository.",{"tags":87,"audiences":89,"affiliations":90,"license":91,"maintenance":93,"resources":94},[88],"enumerative combinatorics",[18],[],[92],"MIT",[23],[61],{"slug":96,"name":97,"nameHtml":97,"summary":98,"summaryHtml":98,"authors":99,"searchText":106,"facets":107},"coupled-tgv-recon","coupled_tgv_recon","MATLAB algorithms for coupled multichannel image reconstruction, including joint magnetic resonance and positron emission tomography reconstruction.",[100,102,103,104],{"name":101,"html":101},"Florian Knoll",{"name":42,"orcid":43,"html":42},{"name":47,"orcid":48,"html":47},{"name":105,"html":105},"Thomas Koesters","coupled_tgv_recon matlab algorithms for coupled multichannel image reconstruction, including joint magnetic resonance and positron emission tomography reconstruction. florian knoll martin holler kristian bredies thomas koesters coupled_tgv_recon provides matlab code for multichannel regularized image reconstruction using coupled total generalized variation. applications include multi-contrast denoising and joint reconstruction of magnetic resonance (mr) and positron emission tomography (pet) measurements. the repository contains a reconstruction algorithm, a control script, and example data and operators. its examples range from a digital brain phantom to an in-vivo mr–pet experiment, for which additional data must be downloaded. the pet examples use emrecon projection operators; some are supplied as compiled matlab extensions. the implementation supports different coupling norms and is designed to be extended to additional datasets and forward operators. the readme documents operator normalization, reconstruction parameters, and platform-specific requirements. the full in-vivo example has substantial memory and runtime requirements.",{"tags":108,"audiences":110,"affiliations":111,"license":112,"maintenance":114,"resources":115},[52,53,54,109],"tomography",[18],[],[113],"GPL-3.0",[23],[61],{"slug":4,"name":5,"nameHtml":5,"summary":6,"summaryHtml":6,"authors":117,"searchText":11,"facets":119},[118],{"name":9,"orcid":10,"html":9},{"tags":120,"audiences":121,"affiliations":122,"license":123,"maintenance":124,"resources":125},[14,15,16],[18],[],[21],[23],[],{"slug":127,"name":128,"nameHtml":128,"summary":129,"summaryHtml":129,"authors":130,"searchText":132,"facets":133},"dependent-bterms","dependent_bterms","SageMath tools for asymptotic expansions with explicit error bounds and a secondary variable whose growth depends on the main variable.",[131],{"name":9,"orcid":10,"html":9},"dependent_bterms sagemath tools for asymptotic expansions with explicit error bounds and a secondary variable whose growth depends on the main variable. benjamin hackl dependent_bterms extends sagemath's asymptoticring framework with a secondary symbolic variable whose growth is bounded by powers of the main asymptotic variable. this supports computations in which, for example, 1 \\leq k \\leq n^{1\u002F2} while n tends to infinity. the toolbox combines asymptotic expansions with explicit error bounds. it provides operations for simplifying expansions, rounding error-bound coefficients, changing the range of validity of bounds, and constructing taylor expansions with explicit remainders. a demonstration notebook introduces the package's capabilities. the individual functions include sagemath examples in their docstrings.",{"tags":134,"audiences":137,"affiliations":138,"license":139,"maintenance":141,"resources":143},[135,136],"asymptotic analysis","symbolic computation",[18],[],[140],"GPL-3.0-or-later",[142],"active",[61],{"slug":145,"name":146,"nameHtml":146,"summary":147,"summaryHtml":147,"authors":148,"searchText":156,"facets":157},"gpdps","GPDPS.jl","A Julia reference implementation of generalized primal-dual proximal splitting for nonsmooth, nonconvex optimization.",[149,152,154],{"name":150,"orcid":151,"html":150},"Christian Clason","https:\u002F\u002Forcid.org\u002F0000-0002-9948-8426",{"name":153,"html":153},"Stanislav Mazurenko",{"name":155,"html":155},"Tuomo Valkonen","gpdps.jl a julia reference implementation of generalized primal-dual proximal splitting for nonsmooth, nonconvex optimization. christian clason stanislav mazurenko tuomo valkonen gpdps.jl provides the reference implementation of a generalized primal-dual proximal splitting approach based on generalized conjugation. it accompanies research on nonsmooth, nonconvex optimization. the package includes examples for an elliptic nash equilibrium problem and a huber–potts image segmentation model. the latter supports isotropic and anisotropic variants and configurable images and regularization parameters. the documented test environment uses julia 1.0–1.2 on macos and linux. the repository supplies a project environment and instructions for instantiating its dependencies; compatibility with newer julia versions should be checked before use.",{"tags":158,"audiences":161,"affiliations":162,"license":163,"maintenance":164,"resources":165},[159,160,53],"numerical optimization","nonsmooth optimization",[18],[],[92],[23],[61,62],{"slug":167,"name":168,"nameHtml":168,"summary":169,"summaryHtml":169,"authors":170,"searchText":176,"facets":177},"graptor","Graptor","GPU-accelerated tomographic reconstruction with variational regularization, including joint reconstruction of complementary electron microscopy channels.",[171,174,175],{"name":172,"orcid":173,"html":172},"Richard Huber","https:\u002F\u002Forcid.org\u002F0000-0003-1743-6786",{"name":42,"orcid":43,"html":42},{"name":47,"orcid":48,"html":47},"graptor gpu-accelerated tomographic reconstruction with variational regularization, including joint reconstruction of complementary electron microscopy channels. richard huber martin holler kristian bredies graptor — graz application for tomographic reconstruction reconstructs images from radon-transform data using iterative variational methods and multi-channel total generalized variation regularization. a particular focus is joint reconstruction of complementary channels, originally haadf and edx measurements in scanning transmission electron tomography. the opencl\u002Fgpu implementation is accompanied by a graphical user interface, preprocessing options, and a command-line reconstruction script. the project originated in a collaboration between mathematics at the university of graz and electron microscopy and nanoanalysis at graz university of technology. the repository includes phantom data and commands for reproducing the numerical results of the associated publication.",{"tags":178,"audiences":180,"affiliations":181,"license":182,"maintenance":183,"resources":184},[109,52,179,55],"numerical analysis",[18],[],[140],[23],[61,62],{"slug":186,"name":187,"nameHtml":187,"summary":188,"summaryHtml":188,"authors":189,"searchText":193,"facets":194},"gratopy","Gratopy","OpenCL-accelerated Radon and fanbeam projections, backprojections, and iterative tomographic reconstruction methods for Python.",[190,191,192],{"name":47,"orcid":48,"html":47},{"name":172,"orcid":173,"html":172},{"name":9,"orcid":10,"html":9},"gratopy opencl-accelerated radon and fanbeam projections, backprojections, and iterative tomographic reconstruction methods for python. kristian bredies richard huber benjamin hackl gratopy — graz accelerated tomographic projections for python provides radon transforms, fanbeam transforms, and their associated backprojections. its pixel-driven projection operators are implemented with opencl for efficient gpu execution and integration with other pyopencl code. the toolbox is intended for developing iterative tomographic reconstruction methods, including optimization-based approaches. it includes landweber, conjugate-gradient, and total-variation reconstruction schemes, together with examples and test data. an experimental radon operator interface supports adjoints and compositions such as r^\\ast r . fanbeam execution remains available through the established projection interface. opencl drivers and a suitable pyopencl installation are required.",{"tags":195,"audiences":196,"affiliations":197,"license":198,"maintenance":199,"resources":200},[109,52,179,55],[18],[],[140],[142],[61,62],{"slug":202,"name":203,"nameHtml":203,"summary":204,"summaryHtml":204,"authors":205,"authorsNote":207,"authorsNoteHtml":207,"searchText":208,"facets":209},"manim","Manim","A community-developed Python library for creating precise mathematical animations programmatically, for explanatory videos, teaching, and presentations.",[206],{"name":9,"orcid":10,"html":9},"and the Manim community","manim a community-developed python library for creating precise mathematical animations programmatically, for explanatory videos, teaching, and presentations. benjamin hackl and the manim community manim community is a python library for creating mathematical animations programmatically. scenes are defined in python and rendered into videos, making it possible to build precise, reproducible visual explanations for teaching, presentations, and science communication. this entry refers to the community edition, which was forked from the animation tool originally created by grant sanderson for 3blue1brown. it is developed by an international community; the author list here highlights a department member rather than attempting to list all contributors. manim can be used from the command line or within jupyter notebooks. the documentation includes installation instructions, tutorials, and an example gallery. an online jupyter environment lets users try it without a local installation.",{"tags":210,"audiences":213,"affiliations":216,"license":217,"maintenance":218,"resources":219},[211,212],"mathematical visualization","animation",[214,215],"teaching","science communication",[],[92],[142],[61],{"slug":221,"name":221,"nameHtml":221,"summary":222,"summaryHtml":222,"authors":223,"searchText":226,"facets":227},"nlpdegm","MATLAB reference implementations of primal-dual extragradient methods for nonlinear, nonsmooth PDE-constrained optimization.",[224,225],{"name":150,"orcid":151,"html":150},{"name":155,"html":155},"nlpdegm matlab reference implementations of primal-dual extragradient methods for nonlinear, nonsmooth pde-constrained optimization. christian clason tuomo valkonen nlpdegm provides matlab reference implementations for primal-dual extragradient methods applied to nonlinear, nonsmooth pde-constrained optimization. it accompanies the research article by christian clason and tuomo valkonen. the repository contains finite-element setup code and implementations for l^1 fitting, l^\\infty fitting, and state-constrained problems. it is paper-specific research code rather than a general-purpose optimization package.",{"tags":228,"audiences":230,"affiliations":231,"license":232,"maintenance":233,"resources":234},[160,229,159],"optimal control",[18],[],[23],[23],[61,62],{"slug":236,"name":237,"nameHtml":237,"summary":238,"summaryHtml":238,"authors":239,"searchText":249,"facets":250},"sage-acsv","sage_acsv","SageMath algorithms for computing asymptotics of multivariate sequences with rational generating functions, using exact algebraic computations.",[240,241,243,245,247],{"name":9,"orcid":10,"html":9},{"name":242,"html":242},"Andrew Luo",{"name":244,"html":244},"Stephen Melczer",{"name":246,"html":246},"Jesse Selover",{"name":248,"html":248},"Elaine Wong","sage_acsv sagemath algorithms for computing asymptotics of multivariate sequences with rational generating functions, using exact algebraic computations. benjamin hackl andrew luo stephen melczer jesse selover elaine wong sage_acsv implements algorithms for analytic combinatorics in several variables in sagemath. it computes asymptotic information about multivariate sequences with rational generating functions, using exact algebraic computations. for generating functions of the form f(\\mathbf{z}) = \\frac{g(\\mathbf{z})}{h(\\mathbf{z})}, the geometry of the singular variety h(\\mathbf{z})=0 is central to the asymptotic analysis. the package's original algorithms treat smooth cases; subsequent work extends the implementation to non-smooth singular varieties under additional geometric assumptions, using whitney stratification. further capabilities include higher-order asymptotic expansions and alternative backends for algebraic computations. documentation and examples are available online, and the package can be explored through binder .",{"tags":251,"audiences":253,"affiliations":254,"license":255,"maintenance":256,"resources":257},[252,135,136],"analytic combinatorics",[18],[],[92],[142],[61,62],{"slug":259,"name":260,"nameHtml":260,"summary":261,"summaryHtml":261,"authors":262,"searchText":268,"facets":269},"sagemath-asymptotic-ring","SageMath Asymptotic Ring","Symbolic arithmetic with univariate and multivariate asymptotic expansions, including polynomial, logarithmic, and exponential growth.",[263,264,266],{"name":9,"orcid":10,"html":9},{"name":265,"html":265},"Daniel Krenn",{"name":267,"html":267},"Clemens Heuberger","sagemath asymptotic ring symbolic arithmetic with univariate and multivariate asymptotic expansions, including polynomial, logarithmic, and exponential growth. benjamin hackl daniel krenn clemens heuberger sagemath's asymptotic ring provides a framework for symbolic asymptotic expansions. it combines growth groups with coefficient rings and supports arithmetic with exact terms and asymptotic error terms in one or several variables. the framework handles polynomial, logarithmic, and exponential growth and provides operations such as multiplication, powers, logarithms, and exponentials of expansions. the sagemath reference manual contains extensive worked examples and describes the available growth groups and term types. this entry concerns the asymptotic-expansion component of sagemath, not the whole computer algebra system. it is distributed as part of sagemath and is distinct from the separate dependent_bterms extension for explicit error bounds with a dependent secondary variable.",{"tags":270,"audiences":271,"affiliations":272,"license":273,"maintenance":275,"resources":276},[135,136],[18],[],[274],"GPL-2.0-or-later",[142],[61],{"slug":278,"name":279,"nameHtml":279,"summary":280,"summaryHtml":280,"authors":281,"searchText":288,"facets":289},"sagemath-banff-cluster-algebras-and-finite-laurent-intersection-rings","Banff cluster algebras and finite Laurent intersection rings in SageMath","SageMath classes for finite Laurent intersection rings (FLIRs) and Banff cluster algebras, with algorithms for membership testing, divisor\u002Fclass group computation, and factorization.",[282,285],{"name":283,"orcid":284,"html":283},"Mara Pompili","https:\u002F\u002Forcid.org\u002F0000-0003-0681-7241",{"name":286,"orcid":287,"html":286},"Daniel Smertnig","https:\u002F\u002Forcid.org\u002F0000-0002-5391-2471","banff cluster algebras and finite laurent intersection rings in sagemath sagemath classes for finite laurent intersection rings (flirs) and banff cluster algebras, with algorithms for membership testing, divisor\u002Fclass group computation, and factorization. mara pompili daniel smertnig this sagemath extension adds two new algebra classes: finitelaurentintersectionring — a finite intersection of laurent polynomial rings together with birational change-of-charts data, providing divisor groups, prime divisors, and class group computations. banffclusteralgebra — a banff (locally acyclic) cluster algebra realized both as a cluster algebra and as a finite laurent intersection ring, giving effective algorithms for membership, divisor groups, class groups, and factorization. these implement the algorithms of pompili and smertnig (2026) , who introduced flirs as a class of rings that contains locally acyclic cluster algebras, full-rank upper cluster algebras, and several other families. the class-group and factoriality algorithms use multivariate polynomial factorization and avoid expensive grobner basis calculations. the code is being added to sagemath via pr #42538 (work in progress) and is licensed under the gnu gpl v2 or later, in line with the rest of sagemath.",{"tags":290,"audiences":293,"affiliations":294,"license":295,"maintenance":296,"resources":297},[291,292,15,136],"cluster algebras","commutative algebra",[18],[],[274],[142],[62],{"slug":299,"name":300,"nameHtml":300,"summary":301,"summaryHtml":301,"authors":302,"searchText":307,"facets":308},"solvopt","SolvOpt","A historical solver for local nonlinear and nonsmooth optimization, distributed with MATLAB, C, and Fortran implementations.",[303,305],{"name":304,"html":304},"Alexei Kuntsevich",{"name":306,"html":306},"Franz Kappel","solvopt a historical solver for local nonlinear and nonsmooth optimization, distributed with matlab, c, and fortran implementations. alexei kuntsevich franz kappel solvopt — solver for local nonlinear optimization problems is a historical university of graz optimization package by alexei kuntsevich and franz kappel. it uses a modified version of shor's r-algorithm for local optimization of nonlinear, potentially nonsmooth functions and supports constrained problems. the department's download site preserves version 1.1, released in june 1997, with matlab, c, and fortran source distributions, test problems, demonstration code, and a detailed manual. this entry records that historical distribution and is marked archived under the directory's pre-2015 update policy. the original installation instructions target much older compiler and matlab environments. compatibility with current systems is not implied. the manual describes the software as freeware; consult its original terms before reuse.",{"tags":309,"audiences":310,"affiliations":311,"license":312,"maintenance":313,"resources":315},[160,159],[18],[],[23],[314],"archived",[61],{"slug":317,"name":318,"nameHtml":318,"summary":319,"summaryHtml":319,"authors":320,"searchText":322,"facets":323},"tgv-pycuda","tgv_pycuda","GPU-accelerated TV and TGV methods for denoising, deblurring, upscaling, dequantization, and compressive imaging in Python.",[321],{"name":47,"orcid":48,"html":47},"tgv_pycuda gpu-accelerated tv and tgv methods for denoising, deblurring, upscaling, dequantization, and compressive imaging in python. kristian bredies tgv_pycuda implements primal-dual algorithms for imaging problems regularized by total variation (tv) and second-order total generalized variation (tgv). the python implementation uses pycuda for gpu acceleration and requires a cuda-capable gpu and a working cuda installation. the repository includes algorithms, tests, and examples for denoising, deblurring, zooming, dequantization, and compressive imaging. a guided jupyter notebook reproduces figures and numerical experiments from the associated publication on recovering piecewise smooth multichannel images.",{"tags":324,"audiences":325,"affiliations":326,"license":327,"maintenance":329,"resources":330},[52,53,159,55],[18],[],[328],"Apache-2.0",[23],[61,62],{"slug":332,"name":332,"nameHtml":332,"summary":333,"summaryHtml":333,"authors":334,"searchText":340,"facets":341},"vectormultibang","MATLAB implementations of convex relaxation for discrete vector-valued optimization, with examples in optimal control and branched transport.",[335,336,338],{"name":150,"orcid":151,"html":150},{"name":337,"html":337},"Carla Tameling",{"name":339,"html":339},"Benedikt Wirth","vectormultibang matlab implementations of convex relaxation for discrete vector-valued optimization, with examples in optimal control and branched transport. christian clason carla tameling benedikt wirth vectormultibang contains matlab implementations accompanying research on convex relaxation of discrete vector-valued optimization problems. these methods address settings in which admissible controls or material choices are restricted to discrete vectors. three groups of examples cover optimal control of the bloch equation, optimal control of linearized elasticity, and multimaterial branched transport. each has a dedicated test script in the repository.",{"tags":342,"audiences":343,"affiliations":344,"license":345,"maintenance":346,"resources":347},[160,229,159],[18],[],[92],[23],[61,62],{"slug":349,"name":349,"nameHtml":349,"summary":350,"summaryHtml":350,"authors":351,"searchText":366,"facets":367},"vitabel","A Python framework for loading, aligning, visualizing, and interactively annotating physiological time series in Jupyter notebooks.",[352,355,358,359,362,365],{"name":353,"orcid":354,"html":353},"Simon Orlob","https:\u002F\u002Forcid.org\u002F0000-0001-7799-4822",{"name":356,"orcid":357,"html":356},"Wolfgang J. Kern","https:\u002F\u002Forcid.org\u002F0000-0001-5080-382X",{"name":9,"orcid":10,"html":9},{"name":360,"orcid":361,"html":360},"Jan Wnent","https:\u002F\u002Forcid.org\u002F0000-0002-8685-858X",{"name":363,"orcid":364,"html":363},"Jan-Thorsten Gräsner","https:\u002F\u002Forcid.org\u002F0000-0001-8143-0376",{"name":42,"orcid":43,"html":42},"vitabel a python framework for loading, aligning, visualizing, and interactively annotating physiological time series in jupyter notebooks. simon orlob wolfgang j. kern benjamin hackl jan wnent jan-thorsten grasner martin holler vitabel is a python framework for loading, visualizing, aligning, and annotating high-resolution physiological time series in jupyter notebooks. it supports retrospective critical-care and perioperative research workflows involving recordings from defibrillators, anaesthesia systems, and patient monitors. its central vitals container combines channels, labels, and metadata. users can align recordings from multiple sources, add derived labels, and curate data for signal processing, statistics, and machine learning. supported workflows include loading defibrillator recordings and vitaldb data, computing ventilation-related signals, and interactively annotating events. the project provides documentation, worked examples, and an interactive binder demonstration .",{"tags":368,"audiences":373,"affiliations":374,"license":375,"maintenance":376,"resources":377},[369,370,371,372],"medical data","time series","data annotation","machine learning",[18],[],[92],[142],[61,62],{"slug":379,"name":379,"nameHtml":379,"summary":380,"summaryHtml":380,"authors":381,"searchText":383,"facets":384},"zero-sum-sequences","Python tools for factoring finite additive sequences into minimal zero-sum sequences and exploring factorization lengths, relations, and automorphism orbits.",[382],{"name":9,"orcid":10,"html":9},"zero-sum-sequences python tools for factoring finite additive sequences into minimal zero-sum sequences and exploring factorization lengths, relations, and automorphism orbits. benjamin hackl zero-sum-sequences provides immutable finite additive sequences and algorithms for factoring them into minimal zero-sum sequences. it runs in ordinary python with networkx and optionally integrates with additive groups supplied by sagemath. for a sequence over an additive group g , the zero-sum condition is g_1 + \\cdots + g_m = 0. the package computes sets of factorization lengths, minimum and maximum lengths, witnesses, and complete factorizations. it also supports atom catalogues, factorization relations, and automorphism orbits. the ambient group and an upper bound for its davenport constant are supplied explicitly by the caller. for example, over c_3 , the minimal zero-sum sequences a=1^3 , b=2^3 , and p=1\\cdot 2 satisfy the factorization relation ab=p^3 . an executable tutorial introduces the api with small examples; the repository also includes benchmarks.",{"tags":385,"audiences":386,"affiliations":387,"license":388,"maintenance":389,"resources":390},[14,15,136],[18],[],[92],[142],[61],{"tags":392,"audiences":423,"affiliations":428,"license":429,"maintenance":438,"resources":444},[393,395,396,397,399,400,401,402,403,404,405,407,409,410,411,412,413,414,415,416,417,418,419,420,421,422],{"value":14,"label":14,"html":14,"count":394},2,{"value":252,"label":252,"html":252,"count":32},{"value":212,"label":212,"html":212,"count":32},{"value":135,"label":135,"html":135,"count":398},3,{"value":291,"label":291,"html":291,"count":32},{"value":292,"label":292,"html":292,"count":32},{"value":371,"label":371,"html":371,"count":32},{"value":88,"label":88,"html":88,"count":32},{"value":16,"label":16,"html":16,"count":32},{"value":15,"label":15,"html":15,"count":398},{"value":55,"label":55,"html":55,"count":406},4,{"value":52,"label":52,"html":52,"count":408},5,{"value":372,"label":372,"html":372,"count":32},{"value":54,"label":54,"html":54,"count":394},{"value":73,"label":73,"html":73,"count":32},{"value":53,"label":53,"html":53,"count":406},{"value":211,"label":211,"html":211,"count":32},{"value":369,"label":369,"html":369,"count":32},{"value":160,"label":160,"html":160,"count":406},{"value":179,"label":179,"html":179,"count":394},{"value":159,"label":159,"html":159,"count":408},{"value":74,"label":74,"html":74,"count":32},{"value":229,"label":229,"html":229,"count":394},{"value":136,"label":136,"html":136,"count":408},{"value":370,"label":370,"html":370,"count":32},{"value":109,"label":109,"html":109,"count":398},[424,426,427],{"value":18,"label":18,"html":18,"count":425},18,{"value":215,"label":215,"html":215,"count":32},{"value":214,"label":214,"html":214,"count":32},[],[430,431,432,433,434,435,437],{"value":328,"label":328,"html":328,"count":32},{"value":21,"label":21,"html":21,"count":32},{"value":274,"label":274,"html":274,"count":394},{"value":113,"label":113,"html":113,"count":32},{"value":140,"label":140,"html":140,"count":398},{"value":92,"label":92,"html":92,"count":436},7,{"value":23,"label":23,"html":23,"count":406},[439,441,442],{"value":142,"label":142,"html":142,"count":440},8,{"value":314,"label":314,"html":314,"count":32},{"value":23,"label":23,"html":23,"count":443},10,[445,447],{"value":61,"label":61,"html":61,"count":446},17,{"value":62,"label":62,"html":62,"count":443},1789745190577]