Multiset/Set/List initiation and use in pseudocode

I'm writing a paper and I've come across interesting problem. In my algorithm, I create a list of 0's (example [0,0,0,0]), where the number of 0's is given by parameter "x". Later I want to update these values using argmin to get the smallest member of this set/list and assign it new value. The problem is how to succinctly describe the creation of such set/list in pseudocode, i.e., mathematical notation.

From what I know, I can't use set, since there are duplicate elements. List have nonstandard notation of add operation and they look weird and there is no notation like "Set-builder" for sets to make the creation of starting list of zeroes in one line. Multi-sets are not very distinguishable from actual sets in notation, which makes it bit confusing for the reader, not mentioning that "Set-builder" notation does not contain what I need to describe it anyway.

I just can't figure out a good way how to deal with this problem.

• You say "pseudocode, i.e., mathematical notation", but pseudocode has different conventions and options from the mathematical notation in the vast majority of math papers that do not use pseudocode. 1. Can you confirm that you want pseudocode rather than a non-pseudocode mathematical presentation? 2. It's unclear if the order of the numbers in your list matters to you, or what you do when multiple entries attain the lowest value. May 8 at 11:05
• @MarkS. I'm sorry I was unclear, I want pseudocode. The order of numbers does not matter to me, however I use argmin in my code to extract the reference to element of minimal value. When I think about it I didn't really think about cases where multiple elements have the minimal value - if argmin is still returning one element or a "subset". May 8 at 14:20

So my current solution to this problem is as follows:

$$MultisetOfZeroes \gets \{0\} \rightarrow x$$

I'm not sure if it is correct however if I understood this answer correctly it should be applicable like that.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 1, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.796284556388855, "perplexity": 514.3012326560201}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-49/segments/1637964358688.35/warc/CC-MAIN-20211129044311-20211129074311-00413.warc.gz"}