Max Alekseyev's profile - overview

● Scholar   × 1

• uniform way to iterate over terms of uni-/multi-variate polynomials

● Organizer   × 1

• values of variables from points in the polyhedron defined by a linear program

● Editor   × 1

• uniform way to iterate over terms of uni-/multi-variate polynomials

● Student   × 1

• installing a newer version of a package within Sage

● Citizen Patrol   × 1

• What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?

● Civic Duty   × 1

• Solve much slower than Mathematica for simple system

● Self-Learner   × 12

• integration with 'maxima' gives different result than 'sympy' and 'mathematica_free'
• Converting algebraic geometry Magma's code to Sage
• mutivariate polynomial with a single variable
• symbolic substitution is done only partially
• define a finite semiring
• How to deal with "GAPError: Error, reached the pre-set memory limit" ?
• efficient generation of unitary divisors
• multiplicative functions for factored integers
• concurrent computation of a function
• unexpected TypeError while creating a polyhedron over ZZ with Normaliz
• "ModuleNotFoundError: No module named 'binascii'" while installing Normaliz in Sage 9.3
• solver parameter not available in Mixed Integer Linear Programming

● Nice Question   × 6

• values of variables from points in the polyhedron defined by a linear program
• iterate over all directed acyclic graphs (DAGs) on n vertices
• gcd on polynomials over ZZ
• concurrent computation of a function
• KeyError followed by AttributeError while calling .closest_vector()
• installing a newer version of a package within Sage

● Guru   × 2

• integrate constantly asks for "zero or nonzero"
• replacing even powers of sin(x) by powers of (1-cos(x)^2)

● Great Answer   × 2

• integrate constantly asks for "zero or nonzero"
• replacing even powers of sin(x) by powers of (1-cos(x)^2)

● Necromancer   × 2

• Change Valuation to do Series Reversion
• "ModuleNotFoundError: No module named 'binascii'" while installing Normaliz in Sage 9.3

● Enlightened   × 1

• Conditional in list

● Associate Editor   × 1

• Elliptic curve $y^2 = x^3-n^2x$ large integral points

● Enthusiast   × 1

● Commentator   × 1

• Construct vectors or lists with 'for', 'if' and 'else'

● Teacher   × 1

• integer solutions to this system of equations

● Supporter   × 1

• installing a newer version of a package within Sage

● Good Question   × 2

• concurrent computation of a function
• installing a newer version of a package within Sage

● Good Answer   × 33

• Missing solutions when using solve
• How to find the graphs from the following collection whose adjacency spectral radius is maximum?
• An error occurred while reading a graph in Plantri format.
• Sage cannot solve non-linear polynomial systems symbolically!
• What does r after a number mean
• How to find a permutation which sends a given list to another given list in SageMath?
• integration with 'maxima' gives different result than 'sympy' and 'mathematica_free'
• An Exercicse from A=B
• symbolic substitution is done only partially
• Replacing an expression by another in the ring of polynomials
• Computing the time of execution
• integrate constantly asks for "zero or nonzero"
• Fastest way to compute the coefficients of this generating function?
• How to solve a formal PDE
• What is the equivalent of Mathematica SymmetricReduction[] in Sage?
• Finding the minimal polynomial for a solution of a trigonometric system of quadratic equations
• Code for guessing formula for integer sequence
• Itertools permutations()
• Find the minimal polynomial of an element over a finite field
• replacing even powers of sin(x) by powers of (1-cos(x)^2)
• What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?
• Action of Permutations on Points, maybe with GAP?
• Spanning elementary subgraphs on a given number of vertices
• Generating random vectors list which are linearly independent
• Finding a unique integer solution to a set of inequalities
• common factor in symbolic expressions
• Symbolic variables with Clifford algebra
• concurrent computation of a function
• How to find all combinations in multinomial case
• How do I use Groebner's basis in SageMath to solve a nonlinear system?
• How to construct a class of matrices satisfying a given matrix equation.
• integer solutions to this system of equations
• Conditional in list

● Famous Question   × 7

• Converting algebraic geometry Magma's code to Sage
• evaluating a string with variable assignments
• ValueError: Cannot pickle code objects from closures
• installing a newer version of a package within Sage
• How to deal with "GAPError: Error, reached the pre-set memory limit" ?
• concurrent computation of a function
• "ModuleNotFoundError: No module named 'binascii'" while installing Normaliz in Sage 9.3

● Notable Question   × 24

• RuntimeError: LattE integrale program failed (exit code -6)
• KeyError followed by AttributeError while calling .closest_vector()
• subsets of Set of unhashable items
• unexpected TypeError while creating a polyhedron over ZZ with Normaliz
• canonical form of `(-1)^(1/4)` and/or `exp(pi*I/4)`
• simplifying/factoring symbolic fractions to fractional powers
• symmetric functions with restricted number of variables
• evaluating a string with variable assignments
• honoring zero element in a custom algebraic structure
• integration with 'maxima' gives different result than 'sympy' and 'mathematica_free'
• mutivariate polynomial with a single variable
• values of variables from points in the polyhedron defined by a linear program
• Converting algebraic geometry Magma's code to Sage
• Computing projection of a polyhedron
• symbolic substitution is done only partially
• "SignalError: Illegal instruction" on calling .right_kernel()
• solver parameter not available in Mixed Integer Linear Programming
• iterate over all directed acyclic graphs (DAGs) on n vertices
• ValueError: Cannot pickle code objects from closures
• uniform way to iterate over terms of uni-/multi-variate polynomials
• How to deal with "GAPError: Error, reached the pre-set memory limit" ?
• installing a newer version of a package within Sage
• concurrent computation of a function
• "ModuleNotFoundError: No module named 'binascii'" while installing Normaliz in Sage 9.3

● Popular Question   × 35

• RuntimeError: LattE integrale program failed (exit code -6)
• unexpected TypeError while creating a polyhedron over ZZ with Normaliz
• simplifying/factoring symbolic fractions to fractional powers
• Implementation of BEST theorem
• Converting between sized and unsized Permutations
• symmetric functions with restricted number of variables
• Limit with variables from array
• width of pretty_print() text output
• evaluating a string with variable assignments
• integration with 'maxima' gives different result than 'sympy' and 'mathematica_free'
• lifting elements of a subgroup to the parent group
• values of variables from points in the polyhedron defined by a linear program
• canonical form of `(-1)^(1/4)` and/or `exp(pi*I/4)`
• symbolic substitution is done only partially
• subsets of Set of unhashable items
• Converting algebraic geometry Magma's code to Sage
• mutivariate polynomial with a single variable
• efficient generation of restricted divisors
• define a finite semiring
• honoring zero element in a custom algebraic structure
• multiplicative functions for factored integers
• non coprime moduli are not supported by CRT for IntegerMod_int
• solver parameter not available in Mixed Integer Linear Programming
• ValueError: Cannot pickle code objects from closures
• "SignalError: Illegal instruction" on calling .right_kernel()
• KeyError followed by AttributeError while calling .closest_vector()
• How to deal with "GAPError: Error, reached the pre-set memory limit" ?
• gcd on polynomials over ZZ
• efficient generation of unitary divisors
• iterate over all directed acyclic graphs (DAGs) on n vertices
• Computing projection of a polyhedron
• concurrent computation of a function
• uniform way to iterate over terms of uni-/multi-variate polynomials
• "ModuleNotFoundError: No module named 'binascii'" while installing Normaliz in Sage 9.3
• installing a newer version of a package within Sage

● Nice Answer   × 119

• mod(k, n) versus k.mod(n)
• Missing solutions when using solve
• A bug on ceil function?
• Recursive computation of a symbolic sum
• How to find the graphs from the following collection whose adjacency spectral radius is maximum?
• Symbolic variables in finite-fields
• An error occurred while reading a graph in Plantri format.
• Compute variety in a finite field despite ideal dimension 1
• Sage cannot solve non-linear polynomial systems symbolically!
• How to get set of all maximal subgroups of a finite group in Sage?
• Example of matrices satisfying certain matrix equation
• Generating special random matrices in sage
• What does r after a number mean
• Find all cycles in an undirected graph
• Removing certain entries from a list of combinations
• Writing polynomial in the generators of a subring
• How to use splines in substitutions
• Adding two moving points on an elliptic curve
• Canonicalize radical not simplifying expression
• integration with 'maxima' gives different result than 'sympy' and 'mathematica_free'
• Taylor expansion in SageMath returns error
• symbolic substitution is done only partially
• The sum function doesn't work in my Jupyter notebook. I get the following error message. Any help appreciated.
• An Exercicse from A=B
• Consider the class of simple, connected unicyclic graphs on $n$ vertices (a graph on $n$ vertices is unicyclic, if it has $n$ edges).
• get the coefficients from the polynomial of several variables
• Implementing characters inside the function
• Replacing an expression by another in the ring of polynomials
• Computing the time of execution
• Generating two integers with conditions
• Solving polynomial equations using Grobner basis technique
• Generate a random integer with some condition
• How to stop code after a given time
• integrate constantly asks for "zero or nonzero"
• Error in Sage? Integer object is not callable
• Ghost numbers when using ARB
• Fastest way to compute the coefficients of this generating function?
• number of arguments does not match number of variables in parent
• Coercion - polynomial in two variable/polynomial in one variable over function field
• Efficient way to compute all possible permutations that sort a list
• Finding the roots of a quartic in GF(p)[x], roots are not correct
• Converting algebraic geometry Magma's code to Sage
• hi any help with TypeError: unable to convert b to an integer
• What is the equivalent of Mathematica SymmetricReduction[] in Sage?
• Simplify an expression in symbolic matrix
• Factorizing matrix entries that are polynomials
• Finding the minimal polynomial for a solution of a trigonometric system of quadratic equations
• errors when read a file with symbols
• Code for guessing formula for integer sequence
• Itertools permutations()
• Regarding remove() function
• More efficient methods for finding subsets of Subsets()
• Rings and Fields in SageMath
• Binary partition function
• Generate the list of all graph isomorphism classes of a given size n
• A linear algebra question
• How to solve a formal PDE
• Find the minimal polynomial of an element over a finite field
• recurrence relation
• Computing ratio of two elements in a large ring
• How to use all cores in solve() method?
• How to eliminate duplicates in a list preserving previous order
• Finding all non-isomorphic $C_5$-free connected planar graphs of order 11.
• Poset whose elements are frozen sets
• Changing the meaning of /
• Get maximally linearly independent set of vectors
• Cayley graph side error
• Evaluation map and ideal from polynomial ring K[X] -> K
• replacing even powers of sin(x) by powers of (1-cos(x)^2)
• Can I create 10-adic numbers?
• Finiteness of a group given by a presentation
• All the solutions of a polynomial system over a finite ring
• Color coding the colorings dictionary in graph_colorings
• What mathematical procedure does sagemath use to solve these types of systems? Is there a better process?
• Action of Permutations on Points, maybe with GAP?
• How do I truncate multivariate polynomials?
• Multivariate polynomial ring with total degree no larger than n
• How to select a serie of sublists according to an other list
• Writing a polynomial as a product of t-numbers
• How to construct a matrix space ?
• fast factorization of ratios of polynomials
• Spanning elementary subgraphs on a given number of vertices
• Exporting from Sage to Macaulay2
• Error Handling
• orthogonalization and orthonormalization of vectors under integer mod
• Generating random vectors list which are linearly independent
• How to truncate a polynomial to a certain power
• Find the longest word in a symmetric group which satisfies a certain property.
• How to find a permutation which sends a given list to another given list in SageMath?
• Finding a unique integer solution to a set of inequalities
• How to use the coppersmith method in sagemath?
• Find polynomial with given residues modulo two other polynomials
• Multiplying elements of D4
• common factor in symbolic expressions
• how to solve an equation including natural log
• Exponential in Clifford algebra
• Symbolic variables with Clifford algebra
• Substituting vars of PowerSeries over RR
• Error computing kernel of matrix over symbolic ring
• How to use the output matrix as an input in Sage
• An error when use subs
• concurrent computation of a function
• number of distinct prime factors of a number
• unexpected TypeError while creating a polyhedron over ZZ with Normaliz
• Change Valuation to do Series Reversion
• How to find all combinations in multinomial case
• How do I use Groebner's basis in SageMath to solve a nonlinear system?
• Find binary solution over non square matrix
• How to create lists of n-tuples efficiently?
• $k$-independence number in graphs
• factor symbolic expression
• How to construct a class of matrices satisfying a given matrix equation.
• Recursive Function Error
• Obtaining incidence algebras for GAP via Sage
• Is there a way to check if a given Elliptic-curve in a finite field has an element with a certain $x$ value?
• Finding isomorphic lists in a big list
• solver parameter not available in Mixed Integer Linear Programming
• integer solutions to this system of equations
• Conditional in list

● Critic   × 1

• what does str(2) return