SearcharxivSearch

arXiv subjects

Evin Liang

Publications and source records attributed to Evin Liang.

7 recordsLinked to original sources

On maximal common divisors in Puiseux monoids

Let $M$ be a commutative monoid. An element $d \in M$ is called a maximal common divisor of a nonempty subset $S$ of $M$ if $d$ is a common divisor of $S$ in $M$ and the only common divisors in $M$ of the set $\big\{ \frac{s}d : s \in S \big\}$ are the units of $M$. In this paper, we investigate the existence of maximal common divisors in rank-$1$ torsion-free commutative monoids, also known as Puiseux monoids. We also establish some connections between the existence of maximal common divisors and both atomicity and the ascending chain condition on principal ideals for the monoids we investigate here.

math.AC

Maximum Number of Quads

We study the maximum number of quads among $\ell$ cards from an EvenQuads deck of size $2^n$. This corresponds to enumerating quadruples of integers in the range $[0,\ell-1]$ such that their bitwise XOR is zero. In this paper, we conjecture a formula that calculates the maximum number of quads among $\ell$ cards.

math.CO

EvenQuads Game and Error-Correcting Codes

EvenQuads is a new card game that is a generalization of the SET game, where each card is characterized by three attributes, each taking four possible values. Four cards form a quad when, for each attribute, the values are the same, all different, or half and half. Given $\ell$ cards from the deck of EvenQuads, we can build an error-correcting linear binary code of length $\ell$ and Hamming distance 4. The quads correspond to codewords of weight 4. Error-correcting codes help us calculate the possible number of quads when given up to 8 cards. We also estimate the number of cards that do not contain quads for decks of different sizes. In addition, we discuss properties of error-correcting codes built on semimagic, magic, and strongly magic quad squares.

math.CO

Card Games Unveiled: Exploring the Underlying Linear Algebra

We discuss four famous card games that can help learn linear algebra. The games are: SET, Socks, Spot it!, and EvenQuads. We describe the game in the language of vector, affine, and projective spaces. We also show how these games are connected to each other. A separate section is devoted to playing Socks with the EvenQuads deck and vice versa.

math.HO

Quad Squares

We study 4-by-4 squares formed by cards from the EvenQuads deck. EvenQuads is a card game with 64 cards where cards have 3 attributes with 4 values in each attribute. A quad is four cards with all attributes the same, all different, or half and half. We define Latin quad squares as squares where the cards in each row and column have different values for each attribute. We define semimagic quad squares as squares where each row and column form a quad. For magic quad squares, we add a requirement that the diagonals have to form a quad. We also define strongly magic quad squares. We analyze types of semimagic and strongly magic quad squares. We also calculate the number of semimagic, magic, and strongly magic quad squares for quad decks of any size. These squares can be described in terms of integers. Four integers form a quad when their bitwise XOR is zero.

math.HO

Generalizing the Wythoff Array and other Fibonacci Facts to Tribonacci Numbers

In this paper, we generalize a lot of facts from John Conway and Alex Ryba's paper, \textit{The extra Fibonacci series and the Empire State Building}, where we replace the Fibonacci sequence with the Tribonacci sequence. We study the Tribonacci array, which we also call \textit{the Trithoff array} to emphasize the connection to the Wythoff array. We describe 13 new sequences.

math.NT

Fun with Latin Squares

Do you want to know what an anti-chiece Latin square is? Or what a non-consecutive toroidal modular Latin square is? We invented a ton of new types of Latin squares, some inspired by existing Sudoku variations. We can't wait to introduce them to you and answer important questions, such as: do they even exist? If so, under what conditions? What are some of their interesting properties? And how do we generate them?

math.HO